Graph
Definition
A graph, or simple graph, is a pair of a set and a set of -element subsets of . The elements of are the vertices of , and the elements of are its edges. Two vertices and are adjacent if . The notation for this edge is , and the notation for adjacency is .
Equivalently, a graph is a set with a relation on that is symmetric and irreflexive. A graph is finite if is finite.
Remarks
In a simple graph, no edge joins a vertex to itself, and two vertices are joined by at most one edge. A multigraph drops the second condition, and some variants allow loops. In a directed graph the edges are ordered pairs. The set is the edge set of .
Where this leads
94 pages build on this one.
- Graph isomorphism
- Multigraph
- A graph is bipartite iff it has no odd cycle
- Neighbourhood
- Connected component
- Euler's theorem on Eulerian circuits
- K5 and K3,3 are not planar
- Every connected graph has a spanning tree
- Trail
- Graph homomorphism
- Cycle
- Tutte's theorem
- Hamiltonian graph
- Unique paths in trees
- Forest
- Prüfer sequence
- Every walk contains a path
- Trees are bipartite
- Rooted tree
- Degrees along an Eulerian trail
- Bridge
- Connected graph
- Characterization of bridges
- Spanning tree
- Every finite tree with at least two vertices has a leaf
- Hamiltonian cycle
- Kuratowski's theorem
- Reachability
- Path
- Regular graph
- Maximum degree
- Cayley's formula
- Tree
- Ore's theorem
- Eulerian trail
- Adjacency matrix
- Subgraph
- Circuit
- Number of odd-degree vertices is even
- Complement graph
- Edge bound for planar graphs
- Degree of a vertex
- Dirac's theorem on Hamiltonian cycles
- Minimum degree
- Induced subgraph
- Walk
- A tree on n vertices has n − 1 edges
- Euler's formula for planar graphs
- Edge set
- Distance in a graph
- Hall's theorem for bipartite graphs
- Handshaking lemma
- Acyclic graph
- Brooks' theorem
- Minimum spanning tree
- Wagner's theorem
- Crossing number inequality
- Rigidity of frameworks
- Net of a polyhedron
- Monodromy theorem
- Jordan's theorem on primitive groups containing a prime cycle
- Mittag-Leffler star
- Laplacian matrix
- Hamiltonian path
- Distance geometry
- Vizing's theorem
- Expander graph
- Line graph
- Dual graph
- Menger's theorem
- Unit distance problem
- Treewidth
- List coloring
- Digital topology
- Cheeger constant
- Strongly regular graph
- k-vertex-connected graph
- Words and profiles
- Grötzsch's theorem
- Strong perfect graph theorem
- Hedetniemi's conjecture
- Petersen's theorem
- Graph minor
- Denjoy–Carleman–Ahlfors theorem
- Random graph
- Friendship theorem
- Perfect graph
- Graph embedding
- Laman graph
- Girth
- Graph reconstruction conjecture
- Kruskal's tree theorem
- Semi-continuity
- Incidence matrix
Further reading
About this page
| Tag | 0JD5C82QMB |
|---|---|
| URI | m2://0JD5C82QMB |
| Kind | definition |
| Writing | W1 stated |
| MSC | 05C99 |
| Defines | Graph |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Graph isomorphism
- Multigraph
- Neighbourhood
- Graph homomorphism
- Adjacency matrix
- Subgraph
- Complement graph
- Walk
- Edge set
- Wagner's theorem
- Rigidity of frameworks
- Laplacian matrix
- Hamiltonian path
- Distance geometry
- Vizing's theorem
- Line graph
- Menger's theorem
- Treewidth
- List coloring
- Cheeger constant
- Strongly regular graph
- k-vertex-connected graph
- Words and profiles
- Grötzsch's theorem
- Strong perfect graph theorem
- Hedetniemi's conjecture
- Petersen's theorem
- Graph minor
- Random graph
- Friendship theorem
- Perfect graph
- Graph embedding
- Laman graph
- Girth
- Graph reconstruction conjecture
- Incidence matrix