An algebraic characterization of completely regular codes in distance-regular graphs

DOI10.1137/S0895480100376496MaRDI QIDQ2784498zbMATH OpenFDO

Authors E. Garriga, Miquel Angel Fiol

Publication date 23 April 2002

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

Full work available at URL https://doi.org/10.1137/S0895480100376496

zbMATH Keywords

completely regular codedistance-regular graphedge-distance-regularitylocal spectrumorthogonal polynomials

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
• scientific article; zbMATH DE number 4104861
• On completely regular codes with minimum eigenvalue in geometric graphs
• Completely regular codes
• Arithmetic completely regular codes

Cited in

(22)

• Classification of a class of distance-regular graphs via completely regular codes
• Yet another distance regular graph related to a Golay code
• Spectral bounds and distance-regularity
• Distance-regular graphs admitting a perfect 1-code
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
• The subconstituent algebra of a strongly regular graph
• A survey on the missing Moore graph
• Arithmetic completely regular codes
• Characterizing completely regular codes from an algebraic viewpoint
• A general method to obtain the spectrum and local spectra of a graph from its regular partitions
• scientific article; zbMATH DE number 4104861 (Why is no real title available?)
• Edge-distance-regular graphs are distance-regular
• Completely regular clique graphs
• On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
• Extremal 1-codes in distance-regular graphs of diameter 3
• On outindependent subgraphs of strongly regular graphs
• Coverings and distance-regular graphs
• Edge-distance-regular graphs
• On the algebraic theory of pseudo-distance-regularity around a set
• On completely regular codes with minimum eigenvalue in geometric graphs
• Tight distance-regular graphs with respect to subsets

This page was built for publication: An algebraic characterization of completely regular codes in distance-regular graphs

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