Linked from

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

• Graph theoryBroader topic: Edges encode the relationships that distinguish one graph from another.

• Directed graphRelated: Direction specifies how each edge connects its endpoint vertices.

• Adjacency matrixRelated: The presence or weight of an edge determines the corresponding matrix entry.

• Complete graphRelated: Each pair of vertices in a complete graph has exactly one edge.

• Graph (discrete mathematics)Broader topic: Edges encode the relationships that distinguish one graph from another.

• Vertex (graph theory)Related: Edges specify which other vertices a given vertex is connected to.

• Breadth-first searchRelated: Each edge leads the traversal from an explored vertex to a possible discovery.

• Matching (graph theory)Related: A matching is a subset of the graph's edges.

• MultigraphRelated: A multigraph can contain distinct edges with identical endpoints.

• Path (graph theory)Related: Every consecutive pair of vertices in a path must share an edge.

• Degree (graph theory)Broader topic: Counting the edges incident to a vertex defines its degree.

• Game treeRelated: Each edge represents a move from one game position to another.

• Connected componentRelated: Edges determine which paths can connect vertices within a component.

• Simple graphRelated: The absence of loops and duplicate edges constrains which edges are allowed.

• Perfect matchingRelated: The selected edges form the pairing that covers the vertices.

• Weighted graphRelated: Weights are attached to these connections.

• Adjacency listBroader topic: Neighbor entries encode the edges incident to each vertex.

• Connected graphRelated: Edges compose the paths that establish connectivity.

• Flow conservationRelated: Each directed edge carries flow into one endpoint and out of another.

• Path graphRelated: Each edge joins one pair of consecutive vertices.

• Undirected graphBroader topic: An undirected graph’s edges connect endpoints without assigning a direction.

• Induced subgraphRelated: Edges qualify for inclusion precisely when both endpoints are selected.

• Hamiltonian cycleRelated: A cycle can use only edges present in the graph.

• Handshaking lemmaBroader topic: Each edge supplies the two endpoint contributions counted by the lemma.

• Directed cycleNarrower topic: Each edge in a directed cycle must point forward along the closed sequence.

• Directed networkRelated: An edge becomes directed when its source and destination are distinguished.

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