Shrikhande graph
Sign in to savestrongly regular graph with 16 vertices and 48 edges
Described at
Shrikhande
jaanos.github.io →This graph is the complement of the Latin square graph for the cyclic Latin square of order 4. The bipartite double is the folded 6-cube, with automorphism group of order 23040 = 25.6!. The folded 6-cube is also the bipartite double of the 4x4 lattice graph H(2,4). The graph that has the triangles of the Shrikhande graph as vertices, adjacent when they share an edge, is the Dyck graph . The complement of the Shrikhande graph has independence number 3 and chromatic number 6. For comparison, the other graph with the same parameters (called 4x4 or H(2,4) or L2(4)) has independence and chromatic number 4, like the Shrikhande graph, and also its complement has independence and chromatic number 4. Thus, the complement of the 4x4 grid graph and the complement of the Shrikhande graph are strongly regular graphs with the same parameters but different independence and chromatic number.
Excerpt from a page describing this subject · 2,224 chars · not written by Vinony
Wikidata facts
- Instance of
- Eulerian graph
- Named after
- Sharadchandra Shankar Shrikhande
- Image
- Shrikhande graph square.svg
- Has parts of class
- edge
Show 9 more facts
- graph diameter
- 2
- studied by
- graph theory
- graph girth
- 3
- Commons category
- Shrikhande graph
- maintained by WikiProject
- WikiProject Mathematics
- graph radius
- 2
- described at URL
- cameroncounts.wordpress.com/2010/08/26/the-shrikhande-graph
- discoverer or inventor
- Sharadchandra Shankar Shrikhande
- time of discovery or invention
- 1959-00-00
Sources (1)
via Wikidata · CC0