An inequality involving two eigenvalues of a bipartite distance-regular graph

DOI10.1016/S0012-365X(00)00154-0zbMath1001.05124WikidataQ127806817 ScholiaQ127806817MaRDI QIDQ1591146

Mark S. MacLean

Publication date: 19 December 2002

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

zbMATH Keywords

distance-regular graphdiameter

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (15)

An \(A\)-invariant subspace for bipartite distance-regular graphs with exactly two irreducible \(T\)-modules with endpoint 2, both thin ⋮ The subconstituent algebra of a strongly regular graph ⋮ The pseudo-cosine sequences of a distance-regular graph ⋮ A new characterization of taut distance-regular graphs of odd diameter ⋮ A new approach to the bipartite fundamental bound ⋮ A new inequality for bipartite distance-regular graphs. ⋮ Leaves in representation diagrams of bipartite distance-regular graphs ⋮ The local eigenvalues of a bipartite distance-regular graph ⋮ Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs ⋮ An inequality on the cosines of a tight distance-regular graph ⋮ Taut distance-regular graphs and the subconstituent algebra ⋮ Distance-regular graphs with light tails ⋮ Taut distance-regular graphs of even diameter ⋮ Tight distance-regular graphs and the subconstituent algebra ⋮ Taut distance-regular graphs of odd diameter

This page was built for publication: An inequality involving two eigenvalues of a bipartite distance-regular graph