Eigenpolytopes of Distance Regular Graphs

DOI10.4153/CJM-1998-040-8zbMath0955.05115OpenAlexW2039498463MaRDI QIDQ4213968

Chris D. Godsil

Publication date: 26 November 2000

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1998-040-8

zbMATH Keywords

eigenvaluedistance-regular graphscharacterizationadjacency matrixeigenpolytope

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (8)

Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ Universal completability, least eigenvalue frameworks, and vector colorings ⋮ Graphical designs and gale duality ⋮ Eigenpolytope Universality and Graphical Designs ⋮ On the automorphism groups of almost all Cayley graphs ⋮ Graphs with given automorphism group and few edge orbits ⋮ Geometry and topology of symmetric point arrangements ⋮ The automorphism groups of some cubic Cayley graphs

This page was built for publication: Eigenpolytopes of Distance Regular Graphs