On strongly closed subgraphs with diameter two and the Q-polynomial property
From MaRDI portal
(Redirected from Publication:854818)
On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property
On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property
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
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- A distance-regular graph with strongly closed subgraphs
- A new inequality for distance-regular graphs
- An inequality for regular near polygons
- Classical distance-regular graphs of negative type
- Distance-regular subgraphs in a distance-regular graph. V
- Distance-regular subgraphs in a distance-regular graph. VI
- Kite-free \(P\)- and \(Q\)-polynomial schemes
- Kite-free distance-regular graphs
- On strongly closed subgraphs of highly 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
- The subconstituent algebra of a strongly regular graph
- Tight distance-regular graphs
- Tight distance-regular graphs with respect to subsets
- Weak-geodetically closed subgraphs in distance-regular graphs
- D-bounded distance-regular graphs
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)
