Shrikhande graph
| Shrikhande graph | |
|---|---|
The Shrikhande graph | |
| Named after | S. S. Shrikhande |
| Vertices | 16 |
| Edges | 48 |
| Radius | 2 |
| Diameter | 2 |
| Girth | 3 |
| Automorphisms | 192 |
| Chromatic number | 4 |
| Chromatic index | 6 |
| Book thickness | 4 |
| Queue number | 3 |
| Properties | Strongly regular Hamiltonian Symmetric Eulerian Integral |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Shrikhande graph is a graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with 16 vertices and 48 edges, with each vertex having degree 6. Every pair of nodes has exactly two other neighbors in common, whether or not the pair of nodes is connected.