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

DOI10.1016/J.DAM.2013.09.018zbMATH Open1298.05197OpenAlexW2023726693MaRDI QIDQ403556FDOQ403556

Authors Marc Cámara, J. Fàbrega, E. Garriga, Miquel Angel 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

completely regular codelocal spectrumsubconstituentspredistance polynomialspseudo-distance-regularity

Mathematics Subject Classification ID

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

Abstract: The local spectrum of a vertex set in a graph has been proven to be very useful to study some of its metric properties. It also has applications in the area of pseudo-distance-regularity around a set and can be used to obtain quasi-spectral characterizations of completely (pseudo-)regular codes. In this paper we study the relation between the local spectrum of a vertex set and the local spectrum of each of its subconstituents. Moreover, we obtain a new characterization for completely pseudo-regular codes, and consequently for completely regular codes, in terms of the relation between the local spectrum of an extremal set of vertices and the local spectrum of its antipodal set. We also present a new proof of the version of the Spectral Excess Theorem for extremal sets of vertices.

Recommendations

• Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
• An algebraic characterization of completely regular codes in distance-regular graphs
• Local and interweight spectra of completely regular codes and of perfect colorings
• On the algebraic theory of pseudo-distance-regularity around a set
• Local spectra of perfect binary codes

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A simple proof of the spectral excess theorem for distance-regular graphs
• An algebraic characterization of completely regular codes in distance-regular graphs
• Association schemes and coding theory
• Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
• Completely regular codes
• Dual distances of completely regular codes
• Eigenvalue interlacing and weight parameters of graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Locally pseudo-distance-regular graphs
• On the Polynomial of a Graph
• On the algebraic theory of pseudo-distance-regularity around a set
• Problems in algebraic combinatorics
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• The spectral excess theorem for distance-regular graphs: a global (over)view
• The subconstituent algebra of an association scheme. I

Cited in

(1)

• Local and interweight spectra of completely regular codes and of perfect colorings

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

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