Pages with the fewest revisions
Showing below up to 50 results in range #1 to #50.
- Bridgeless graph (1 revision)
- Distance-transitive graph (1 revision)
- Octahedron graph (1 revision)
- Eccentricity of a vertex (1 revision)
- Normalized Laplacian matrix (1 revision)
- Coxeter graph (1 revision)
- Symmetric graph (1 revision)
- Forest (1 revision)
- Odd girth (1 revision)
- Cubic graph (1 revision)
- Handshaking lemma (1 revision)
- Degree of a vertex (1 revision)
- Graph of finite diameter (1 revision)
- Dihedral graph (1 revision)
- Self-complementary graph implies chromatic number is at least equal to square root of size of vertex set (1 revision)
- Hyperoctahedron graph (1 revision)
- Cage (1 revision)
- Tree has either one central vertex or two adjacent central vertices (1 revision)
- Integral graph (1 revision)
- Prism of a graph (1 revision)
- Chromatic index (1 revision)
- Bridge (1 revision)
- Paley graph:P13 (1 revision)
- Connected graph (1 revision)
- Diameter of a graph (2 revisions)
- Vertex-transitive graph (2 revisions)
- Complete bipartite graph:K1,3 (2 revisions)
- Conference graph (2 revisions)
- Self-complementary graph (2 revisions)
- Graph of constant finite eccentricity (2 revisions)
- Tutte-Coxeter graph (2 revisions)
- Central vertex (2 revisions)
- Strongly regular graph (2 revisions)
- Main Page (2 revisions)
- Connected graph may have precisely two non-adjacent central vertices (2 revisions)
- Girth of a graph (2 revisions)
- Edge-transitive graph (2 revisions)
- Hoffman-Singleton graph (2 revisions)
- Adjacency matrix (2 revisions)
- Triangle-free graph (2 revisions)
- Characteristic polynomial of a graph (2 revisions)
- Degree sequence of a graph (2 revisions)
- Complete graph:K5 (2 revisions)
- Complete graph (2 revisions)
- Tree (2 revisions)
- Eccentricity sequence of a graph of finite diameter (3 revisions)
- Cycle graph (3 revisions)
- Desargues graph (3 revisions)
- Clique number (3 revisions)
- Circuit rank (3 revisions)