TOPICS
Search

Delsarte Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60).

It is distance-regular as well as distance-transitive with intersection array {110,72;1,60} and has graph spectrum (-25)^(22)2^(220)110^1.

It is implemented in the Wolfram Language as GraphData["DelsarteGraph"].

See also

Distance-Regular Graph, Distance-Transitive Graph, Strongly Regular Graph

Explore with Wolfram|Alpha

References

Berlekamp, E R.; van Lint, J. H.; and Seidel, J. J. "A Strongly Regular Graph Derived from the Perfect Ternary Golay Code." In A Survey of Combinatorial Theory, Symp. Colorado State Univ., 1971 (Ed. J. N. Srivastava et al.) Amsterdam, Netherlands: North Holland, 1973.Delsarte, P. "An Algebraic Approach to the Association Schemes of Coding Theory." Philips Res. Reports Suppl. 10, 1973.DistanceRegular.org. "Delsarte graph." https://www.distanceregular.org/graphs/delsarte.html.

Referenced on Wolfram|Alpha

Delsarte Graph

Cite this as:

Weisstein, Eric W. "Delsarte Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/DelsarteGraph.html

Subject classifications