Pseudo-distance-regularized graphs are distance-regular or distance-biregular
From MaRDI portal
Publication:454837
DOI10.1016/J.LAA.2012.07.019zbMATH Open1251.05045arXiv1205.5687OpenAlexW2025894182MaRDI QIDQ454837FDOQ454837
Authors: Miquel Angel Fiol 
Publication date: 10 October 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: The concept of pseudo-distance-regularity around a vertex of a graph is a natural generalization, for non-regular graphs, of the standard distance-regularity around a vertex. In this note, we prove that a pseudo-distance-regular graph around each of its vertices is either distance-regular or distance-biregular. By using a combinatorial approach, the same conclusion was reached by Godsil and Shawe-Taylor for a distance-regular graph around each of its vertices. Thus, our proof, which is of an algebraic nature, can also be seen as an alternative demonstration of Godsil and Shawe-Taylor's theorem.
Full work available at URL: https://arxiv.org/abs/1205.5687
Recommendations
- Distance-regularised graphs are distance-regular or distance-biregular
- Pseudo 1-homogeneous distance-regular graphs
- Locally pseudo-distance-regular graphs
- Distance biregular bipartite graphs
- scientific article; zbMATH DE number 867658
- Edge-distance-regular graphs are distance-regular
- Bipartite distance-regular graphs. I
- scientific article; zbMATH DE number 43547
- Distance-regular graphs
- A characterization of bipartite distance-regular graphs
Cites Work
- Title not available (Why is that?)
- Distance biregular bipartite graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Locally pseudo-distance-regular graphs
- Problems in algebraic combinatorics
- The Gewirtz graph: An exercise in the theory of graph spectra
- Title not available (Why is that?)
- Feasibility conditions for the existence of walk-regular graphs
- Algebraic characterizations of distance-regular graphs
- On the algebraic theory of pseudo-distance-regularity around a set
- On pseudo-distance-regularity
Cited In (9)
- Completely regular clique graphs. II
- Pseudo-Strong Regularity Around a Set
- Distance mean-regular graphs
- On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Pseudo 1-homogeneous distance-regular graphs
- A Spectral Moore Bound for Bipartite Semiregular Graphs
- On the Terwilliger algebra of distance-biregular graphs
- The spectral excess theorem for distance-biregular graphs.
This page was built for publication: Pseudo-distance-regularized graphs are distance-regular or distance-biregular
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454837)
