The girth of a thin distance-regular graph
From MaRDI portal
Publication:675886
DOI10.1007/BF01202234zbMath0878.05084MaRDI QIDQ675886
Publication date: 11 March 1997
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Terwilliger algebra; distance-regular graph; diameter; girth; regular generalized quadrangle; thin graph
05E30: Association schemes, strongly regular graphs
51E12: Generalized quadrangles and generalized polygons in finite geometry
05C12: Distance in graphs
Related Items
A generalization of the Terwilliger algebra, Two linear transformations each tridiagonal with respect to an eigenbasis of the other, The Terwilliger algebra of the hypercube, The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra, The Terwilliger algebra of a distance-regular graph of negative type, Distance-regular graphs which support a spin model are thin, The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes, Almost 2-homogeneous bipartite distance-regular graphs, The generalized Terwilliger algebra and its finite-dimensional modules when \(d=2\), Algebraic characterizations of graph regularity conditions, The Terwilliger algebra of an almost-bipartite \(P\)- and \(Q\)-polynomial association scheme, An inequality involving the local eigenvalues of a distance-regular graph, The subconstituent algebra of a distance-regular graph; thin modules with endpoint one, Tight distance-regular graphs and the subconstituent algebra, The subconstituent algebra of a strongly regular graph, The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two, \(Q\)-polynomial distance-regular graphs with \(a_1=0\) and \(a_2\neq 0\)
Cites Work
- Unnamed Item
- Unnamed Item
- The irreducible modules of the Terwilliger algebras of Doob schemes
- The subconstituent algebra of an association scheme. I
- The subconstituent algebra of an association scheme. III
- The subconstituent algebra of an association scheme. II
- Distance-transitive graphs and generalized polygons
- Twice Q-polynomial distance-regular graphs are thin
