Dual concepts of almost distance-regularity and the spectral excess theorem
From MaRDI portal
(Redirected from Publication:442405)
Abstract: Generally speaking, `almost distance-regular' graphs share some, but not necessarily all, of the regularity properties that characterize distance-regular graphs. In this paper we propose two new dual concepts of almost distance-regularity, thus giving a better understanding of the properties of distance-regular graphs. More precisely, we characterize -partially distance-regular graphs and -punctually eigenspace distance-regular graphs by using their spectra. Our results can also be seen as a generalization of the so-called spectral excess theorem for distance-regular graphs, and they lead to a dual version of it.
Recommendations
- Spectral bounds and distance-regularity
- On a version of the spectral excess theorem
- A proof of a conjecture on the distance spectral radius
- Prox-regularity of spectral functions and spectral sets
- Duality and distance formulas in Lipschitz-Hölder spaces
- A generalized spectral duality theorem
- scientific article; zbMATH DE number 903746
- scientific article; zbMATH DE number 3942112
- Regularity of the optimal sets for some spectral functionals
- The generalized spectral radius and extremal norms
Cites work
- A simple proof of the spectral excess theorem for distance-regular graphs
- Algebraic characterizations of distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 867658 (Why is no real title available?)
- Locally pseudo-distance-regular graphs
- On \(k\)-walk-regular graphs
- On almost distance-regular graphs
- On pseudo-distance-regularity
- On the Polynomial of a Graph
- 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
Cited in
(11)- On almost distance-regular graphs
- A characterization of bipartite distance-regular graphs
- Algebraic characterizations of regularity properties in bipartite graphs
- Edge-distance-regular graphs
- A spectral equivalent condition of the P-polynomial property for association schemes
- A spectral excess theorem for nonregular graphs
- A spectral excess theorem for normal digraphs
- A spectral excess theorem for digraphs with normal Laplacian matrices
- Edge-distance-regular graphs
- On perturbations of almost distance-regular graphs
- On two algebras of token graphs
This page was built for publication: Dual concepts of almost distance-regularity and the spectral excess theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442405)