An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs

DOI10.1137/S0895480100376496zbMath1044.05069MaRDI QIDQ2784498

E. Garriga, Miquel Àngel Fiol

Publication date: 23 April 2002

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

orthogonal polynomialsdistance-regular graphlocal spectrumcompletely regular codeedge-distance-regularity

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (9)

On outindependent subgraphs of strongly regular graphs ⋮ The subconstituent algebra of a strongly regular graph ⋮ Edge-distance-regular graphs are distance-regular ⋮ A survey on the missing Moore graph ⋮ Completely regular clique graphs ⋮ On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes ⋮ Edge-distance-regular graphs ⋮ Spectral bounds and distance-regularity ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions

This page was built for publication: An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs