Classification of a class of distance-regular graphs via completely regular codes

DOI10.1016/0166-218X(90)90106-MzbMath0687.05015OpenAlexW1989162332MaRDI QIDQ1262870

Josep Rifà, Llorenç Huguet

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90106-m

zbMATH Keywords

distance-regular graphsP-polynomial association chemes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other designs, configurations (05B30) Graph theory (05C99)

Related Items

A distance-regular graph with bipartite geodetically closed subgraphs., The subconstituent algebra of an association scheme. I, Almost 2-homogeneous graphs and completely regular quadrangles, Almost 2-homogeneous bipartite distance-regular graphs, On uniformly geodetic graphs, Locally triangular graphs and rectagraphs with symmetry

Cites Work

• Characterization of H(n,q) by the parameters
• On the Nonexistence of Perfect Codes over Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item