On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property
From MaRDI portal
Publication:854818
DOI10.1016/j.ejc.2005.07.009zbMath1200.05264OpenAlexW2008080734MaRDI QIDQ854818
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.07.009
Related Items (4)
On bipartite distance-regular graphs with a strongly closed subgraph of diameter three ⋮ Sharp tridiagonal pairs ⋮ Towards a classification of the tridiagonal pairs ⋮ The structure of a tridiagonal pair
Cites Work
- Unnamed Item
- Unnamed Item
- \(D\)-bounded distance-regular graphs
- Tight distance-regular graphs with respect to subsets
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- Weak-geodetically closed subgraphs in distance-regular graphs
- Distance-regular subgraphs in a distance-regular graph. V
- Distance-regular subgraphs in a distance-regular graph. VI
- Classical distance-regular graphs of negative type
- A new inequality for distance-regular graphs
- Parallelogram-free distance-regular graphs
- Tight distance-regular graphs
- A distance-regular graph with strongly closed subgraphs
- An inequality for regular near polygons
- On strongly closed subgraphs of highly regular graphs
- Kite-free \(P\)- and \(Q\)-polynomial schemes
- Kite-free distance-regular graphs
- Strongly closed subgraphs in a regular thick near polygon
- The subconstituent algebra of a strongly regular graph
- STRONGLY CLOSED SUBGRAPHS OF A DISTANCE-REGULAR GRAPH WITH GEOMETRIC GIRTH FIVE
This page was built for publication: On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property
