On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph

DOI10.1080/03081089508818376zbMath0831.05058OpenAlexW2026417772WikidataQ123344953 ScholiaQ123344953MaRDI QIDQ4853922

Jack H. Koolen

Publication date: 12 February 1996

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089508818376

zbMATH Keywords

neighboursdistance-regular graphscompletely regular codesintersection matrixregular graphMartin's conjectureBiggs-Smith graph

Mathematics Subject Classification ID

Other types of codes (94B60) Graph theory (05C99) Combinatorial codes (94B25)

Uses Software

• nauty

Cites Work

• Feasibility conditions for the existence of walk-regular graphs
• Completely regular codes
• More on the group \(Y_{555}\) and the projective plane of order 3
• On Trivalent Graphs

This page was built for publication: On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph