KnowraSimple graphLinked fromLinked fromThe 14 pages that link to Simple graph, each with the reason it gives.All 14Broader topic 1Related 6Narrower topic 4Compared with 3Complete graphNarrower topic: Complete graphs use this convention, so their edges join distinct pairs only.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.Erdős–Gallai theorem (degree sequences)Narrower topic: The theorem tests realizability specifically under these restrictions.