from Part III - Properties of the Shrikhande Graph
Published online by Cambridge University Press: 05 June 2026
In this chapter, we give the various properties and parameters of the Shrikhande graph; these have all been introduced earlier.
Vertices, edges, regularity The Shrikhande graph has 16 vertices and 48 edges. It is regular with degree 6. It is strongly regular: any two vertices have two common neighbours.
Symmetry The Shrikhande graph is vertex, edge and flag transitive. Its automorphism group is (Z4)2 : D12, of order 192, and has two orbits on non-edges.
Euler and Hamilton Since all vertices have even degree, the graph is Eulerian.
It is also Hamiltonian. Consider the description in Section 2.6. By using only four of the six types of edges given there
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.