Classification of graphs by regularity

DOI10.1016/0095-8956(81)90049-6MaRDI QIDQ1137601zbMATH OpenOpenAlexFDO

Authors 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

adjacency matrixalgebra of polynomialsclassification of graphsdistance regularedge-regularorthogonal polynomialsregular

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• A characterization of tetrahedral graphs
• Distances, graphs and designs
• scientific article; zbMATH DE number 3146146 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Strongly regular graphs
• Strongly regular graphs, partial geometries and partially balanced designs

Cited in

(1)

• On the parameters of codes for the Lee and modular distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137601)