TOPICS
Search

Janko-Kharaghani Graphs


The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), respectively.

The first is implemented in the Wolfram Language as GraphData["JankoKharaghaniGraph936"].


See also

Ionin-Kharaghani Graph, Janko-Kharaghani-Tonchev Graph, Strongly Regular Graph

Explore with Wolfram|Alpha

References

Gibbons, P. B. and Mathon, R. "Construction Methods for Bhaskar Rao and Related Designs." J. Austral. Math. Soc. Ser. A 42, 5-30, 1987.Janko, Z. and Kharaghani, H. "A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs." J. Combin. Theory Ser. A 98, 118-126, 2002.

Cite this as:

Weisstein, Eric W. "Janko-Kharaghani Graphs." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Janko-KharaghaniGraphs.html

Subject classifications