On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes

DOI10.1016/j.dam.2013.09.018zbMath1298.05197arXiv1212.3815OpenAlexW2023726693MaRDI QIDQ403556

M. Cámara, J. Fàbrega, E. Garriga, Miquel Àngel Fiol

Publication date: 29 August 2014

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

Full work available at URL: https://arxiv.org/abs/1212.3815

zbMATH Keywords

subconstituentslocal spectrumcompletely regular codepredistance polynomialspseudo-distance-regularity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The subconstituent algebra of an association scheme. I
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Locally pseudo-distance-regular graphs
• Completely regular codes
• Eigenvalue interlacing and weight parameters of graphs
• Problems in algebraic combinatorics
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Dual distances of completely regular codes
• 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
• An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
• On the Polynomial of a Graph
• Association schemes and coding theory
• On the algebraic theory of pseudo-distance-regularity around a set

This page was built for publication: On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes