Linked from

The 23 pages that link to Vertex (graph theory), each with the reason it gives.

• Directed graphRelated: Each directed edge begins and ends at vertices.

• Adjacency matrixRelated: Each vertex corresponds to one row and one column of the matrix.

• Complete graphRelated: Completeness requires every pair of distinct vertices to be adjacent.

• Edge (graph theory)Related: An edge is defined by the vertex or vertices it connects.

• Breadth-first searchRelated: Breadth-first search marks and processes vertices one at a time.

• MultigraphRelated: Multiple edges in a multigraph connect the same pair of vertices.

• Path (graph theory)Related: Each position in a path is occupied by a vertex.

• Connected componentRelated: Components partition the graph’s vertices into maximal connected groups.

• Simple graphRelated: A simple graph's vertices are the endpoints that its edges may join.

• Perfect matchingRelated: A perfect matching must cover every vertex exactly once.

• Weighted graphRelated: Vertices are the endpoints between which weighted edges express relationships.

• Connected graphRelated: Connectedness asks whether every pair of vertices can be linked.

• Flow conservationRelated: The conservation rule is applied separately at each network vertex.

• Path graphRelated: The vertices form the ordered sequence that defines a path graph.

• Graph automorphismRelated: An automorphism rearranges vertices while keeping the graph’s structure intact.

• Hamiltonian cycleRelated: The requirement concerns visiting every vertex exactly once.

• Directed networkRelated: Vertices are the entities connected by the network's oriented links.

• Homogeneous networkRelated: A network may be homogeneous because its vertices share a relevant type.