Tails of bipartite distance-regular graphs
From MaRDI portal
Publication:1864613
DOI10.1006/eujc.2002.0611zbMath1012.05159MaRDI QIDQ1864613
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
05E30: Association schemes, strongly regular graphs
Related Items
Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets, Bipartite distance-regular graphs: the \(Q\)-polynomial property and pseudo primitive idempotents, The \(Q\)-polynomial idempotents of a distance-regular graph, A characterization of Leonard pairs using the notion of a tail, On bipartite \(Q\)-polynomial distance-regular graphs, Distance-regular graphs with light tails, 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
Cites Work