Linked from

The 14 pages that link to Simple graph, each with the reason it gives.

• Directed graphRelated: Simplicity constrains loops and repeated edges independently of direction.

• Adjacency matrixRelated: Its adjacency matrix is symmetric, has a zero diagonal, and uses binary entries.

• Complete graphNarrower topic: Complete graphs use this convention, so their edges join distinct pairs only.

• Edge (graph theory)Broader topic: Its restrictions give edges a particularly uncomplicated form.

• MultigraphCompared with: It excludes both features that distinguish common multigraph conventions.

• Line graphRelated: For simple inputs, the line graph is also simple.

• Undirected graphRelated: This common undirected-graph convention excludes two kinds of edge repetition.

• Graph automorphismNarrower topic: For simple graphs, preserving adjacency and nonadjacency characterizes automorphisms.

• Turán's theoremNarrower topic: Turán's theorem concerns edge counts in finite simple graphs.

• Edge contractionCompared with: In simple graphs, loops are discarded and parallel edges are merged after contraction.

• Erdős–Gallai theorem (degree sequences)Narrower topic: The theorem tests realizability specifically under these restrictions.

• Fáry's theoremRelated: The theorem's standard statement assumes this restriction on the graph.

• Conway's thrackle conjectureRelated: The standard conjecture is framed for simple graphs.

• Multilayer and multiplex networksCompared with: A simple graph has one connection structure, rather than distinct interacting layers.