Tight distance-regular graphs with respect to subsets

DOI10.1016/j.ejc.2005.09.004zbMath1105.05075OpenAlexW2000963215MaRDI QIDQ854807

Rie Hosoya, Hiroshi Suzuki

Publication date: 7 December 2006

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.09.004

zbMATH Keywords

tight graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (6)

On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ On bipartite distance-regular graphs with a strongly closed subgraph of diameter three ⋮ Dual polar graphs, a nil-DAHA of rank one, and non-symmetric dual \(q\)-Krawtchouk polynomials ⋮ A bilinear form relating two Leonard systems ⋮ Commutative association schemes ⋮ Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Width and dual width of subsets in polynomial association schemes
• Tight distance-regular graphs
• 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
• Tight distance-regular graphs and the subconstituent algebra
• The subconstituent algebra of a strongly regular graph
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs

This page was built for publication: Tight distance-regular graphs with respect to subsets