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...

squares of order 4n + 2 for any n. Shrikhande's specialties were combinatorics and statistical designs. The Shrikhande graph is used in statistical design...

4 coincide with those of the Shrikhande graph, but the two graphs are not isomorphic. The line graph of a complete graph Kn is an srg ⁡ ( ( n 2 ) , 2...

strongly regular graph, the Shrikhande graph, with the same parameters as the 4 × 4 {\displaystyle 4\times 4} rook's graph. The Shrikhande graph obeys the same...

graph Cameron graph Petersen graph Hall–Janko graph Hoffman–Singleton graph Higman–Sims graph Paley graph of order 13 Shrikhande graph Schläfli graph...

its parameters with the Shrikhande graph. When both sides of the bipartition have the same number of vertices, these graphs are again strongly regular...

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving...

graph. It has book thickness 3 and queue number 2. The Dyck graph is a toroidal graph; the dual of its symmetric toroidal embedding is the Shrikhande...

the Shrikhande graph and the Hoffman graph are integral. A regular graph is periodic if and only if it is an integral graph. A walk-regular graph that...

S2CID 9173731 Naik, Ranjan N.; Rao, S. B.; Shrikhande, S. S.; Singhi, N. M. (1982), "Intersection graphs of k-uniform hypergraphs", European Journal...