Linked from

The 8 pages that link to Undirected graph, each with the reason it gives.

• Directed graphCompared with: Unlike directed edges, its connections do not distinguish source from destination.

• Cayley graphCompared with: Symmetric generating sets make generator steps reversible and the graph undirected.

• Adjacency listCompared with: Each edge usually appears in both endpoint lists.

• Flow networkCompared with: It lacks the one-way edge structure used in this network.

• Symmetric relationRelated: Adjacency in an undirected graph forms a symmetric relation on vertices.

• Handshaking lemmaBroader topic: Without direction, each edge has two endpoints counted in the degree sum.

• Directed networkCompared with: Its links are symmetric, unlike the potentially one-way links here.

• Friends and strangers theoremRelated: Whether two people are friends is treated as a mutual, directionless relationship.