On strongly closed subgraphs with diameter two and the Q-polynomial property
From MaRDI portal
Publication:854818
DOI10.1016/J.EJC.2005.07.009zbMATH Open1200.05264OpenAlexW2008080734MaRDI QIDQ854818FDOQ854818
Authors: H. 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.07.009
Recommendations
- Tight distance-regular graphs and the \(Q\)-polynomial property
- A characterization of some distance-regular graphs by strongly closed subgraphs
- Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
- scientific article; zbMATH DE number 1379440
Cites Work
- Title not available (Why is that?)
- The subconstituent algebra of a strongly regular graph
- Title not available (Why is that?)
- Classical distance-regular graphs of negative type
- A new inequality for distance-regular graphs
- Kite-free \(P\)- and \(Q\)-polynomial schemes
- \(D\)-bounded distance-regular graphs
- Kite-free distance-regular graphs
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- Tight distance-regular graphs
- Weak-geodetically closed subgraphs in distance-regular graphs
- Parallelogram-free distance-regular graphs
- STRONGLY CLOSED SUBGRAPHS OF A DISTANCE-REGULAR GRAPH WITH GEOMETRIC GIRTH FIVE
- Strongly closed subgraphs in a regular thick near polygon
- Tight distance-regular graphs with respect to subsets
- An inequality for regular near polygons
- On strongly closed subgraphs of highly regular graphs
- Distance-regular subgraphs in a distance-regular graph. V
- Distance-regular subgraphs in a distance-regular graph. VI
- A distance-regular graph with strongly closed subgraphs
Cited In (6)
- Towards a classification of the tridiagonal pairs
- The structure of a tridiagonal pair
- Tight distance-regular graphs and the \(Q\)-polynomial property
- On bipartite distance-regular graphs with a strongly closed subgraph of diameter three
- Tight distance-regular graphs with respect to subsets
- Sharp tridiagonal pairs
This page was built for publication: On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854818)