Classification of graphs by regularity

DOI10.1016/0095-8956(81)90049-6zbMath0429.05058OpenAlexW1985736481MaRDI QIDQ1137601

Arnold Neumaier

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90049-6

zbMATH Keywords

orthogonal polynomialsadjacency matrixregularclassification of graphsalgebra of polynomialsdistance regularedge-regular

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (1)

On the parameters of codes for the Lee and modular distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distances, graphs and designs
• Strongly regular graphs
• Strongly regular graphs, partial geometries and partially balanced designs
• A characterization of tetrahedral graphs

This page was built for publication: Classification of graphs by regularity