A finite set of vertices V and edges E ⊆ V × V. Simple, undirected unless stated otherwise. Directed graphs and multigraphs are variants.
Graph G = (V, E)
Related concepts
- Path
- Cycle
- Tree (graph-theoretic)
- Planar graph
- Euler circuit
- Hamilton cycle
- Max-flow min-cut theorem
- Graph colouring
- Combination C(n,k) = nCr
- Ramsey's theorem
- Matroid
- Bipartite graph
- Matching
- Random graph (Erdős–Rényi)
- Spectral graph theory
- Eulerian trail/circuit
- Hamiltonian cycle / Dirac theorem
- Menger's theorem
- Turán's theorem
- Kuratowski theorem