Tails of bipartite distance-regular graphs

DOI10.1006/eujc.2002.0611zbMath1012.05159OpenAlexW2060267832MaRDI QIDQ1864613

Michael S. Lang

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2002.0611

zbMATH Keywords

eigenvaluedistance-regular graphdiameterprimitive idempotentKrein parameters

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (9)

On bipartite \(Q\)-polynomial distance-regular graphs ⋮ Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ The \(Q\)-polynomial idempotents of a distance-regular graph ⋮ Bipartite distance-regular graphs: the \(Q\)-polynomial property and pseudo primitive idempotents ⋮ A characterization of Leonard pairs using the notion of a tail ⋮ Leaves in representation diagrams of bipartite distance-regular graphs ⋮ A characterization of bipartite Leonard pairs using the notion of a tail ⋮ Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs ⋮ Distance-regular graphs with light tails

Cites Work

• A new inequality for distance-regular graphs
• A new inequality for bipartite distance-regular graphs.
• Unnamed Item

This page was built for publication: Tails of bipartite distance-regular graphs