All pages
- Adjacency matrix
- Bridge
- Bridgeless graph
- Cage
- Central vertex
- Characteristic polynomial of a graph
- Chromatic index
- Chromatic number
- Circuit rank
- Clique number
- Complete bipartite graph
- Complete bipartite graph:K1,3
- Complete bipartite graph:K3,3
- Complete graph
- Complete graph:K4
- Complete graph:K5
- Conference graph
- Connected graph
- Connected graph may have precisely two non-adjacent central vertices
- Coxeter graph
- Cube graph
- Cubic graph
- Cycle graph
- Cycle graph:C5
- Degree matrix
- Degree of a vertex
- Degree sequence of a graph
- Desargues graph
- Diameter of a graph
- Dihedral graph
- Distance-transitive graph
- Eccentricity of a vertex
- Eccentricity sequence of a graph of finite diameter
- Edge-transitive graph
- Forest
- Girth of a graph
- Graph of constant finite eccentricity
- Graph of finite diameter
- Handshaking lemma
- Heawood graph
- Hoffman-Singleton graph
- Hypercube graph
- Hyperoctahedron graph
- Incidence matrix
- Integral graph
- Kneser graph
- Laplacian matrix
- Line graph
- Main Page
- Normalized Laplacian matrix
- Octahedron graph
- Odd girth
- Odd graph
- Paley graph
- Paley graph:P13
- Paley graph:P17
- Pappus graph
- Petersen graph
- Prism of a graph
- Radius of a graph
- Ramsey number
- Regular graph
- Self-complementary graph
- Self-complementary graph implies chromatic number is at least equal to square root of size of vertex set
- Square graph
- Star
- Strongly regular graph
- Symmetric graph
- Tree
- Tree has either one central vertex or two adjacent central vertices
- Triangle-free graph
- Triangle graph
- Tutte-Coxeter graph
- Vertex-transitive graph