Pseudo-distance-regularized graphs are distance-regular or distance-biregular

DOI10.1016/j.laa.2012.07.019zbMath1251.05045arXiv1205.5687OpenAlexW2025894182MaRDI QIDQ454837

J. Herrera, D. Rodríguez-Gómez

Publication date: 10 October 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

local spectrumpredistance polynomialsdistance-biregular graphpseudo-distance-regular graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (6)

A Spectral Moore Bound for Bipartite Semiregular Graphs ⋮ Distance mean-regular graphs ⋮ On the Terwilliger algebra of distance-biregular graphs ⋮ The spectral excess theorem for distance-biregular graphs. ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs ⋮ Completely regular clique graphs. II

Cites Work

• Unnamed Item
• Unnamed Item
• Locally pseudo-distance-regular graphs
• Feasibility conditions for the existence of walk-regular graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Distance biregular bipartite graphs
• Problems in algebraic combinatorics
• Algebraic characterizations of distance-regular graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• On pseudo-distance-regularity
• On the algebraic theory of pseudo-distance-regularity around a set

This page was built for publication: Pseudo-distance-regularized graphs are distance-regular or distance-biregular