A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
From MaRDI portal
Publication:1867281
DOI10.1016/S0195-6698(02)00144-0zbMath1010.05081OpenAlexW4242256584MaRDI QIDQ1867281
Publication date: 2 April 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(02)00144-0
Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75)
Related Items (12)
A distance-regular graph with bipartite geodetically closed subgraphs. ⋮ A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers ⋮ A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs ⋮ The Terwilliger algebra of the incidence graphs of Johnson geometry ⋮ A characterization of the Hamming graph by strongly closed subgraphs ⋮ Applications of the retracing method for distance-regular graphs ⋮ On the automorphism group of doubled Grassmann graphs ⋮ The Terwilliger algebra of the incidence graphs of Johnson geometry. II. ⋮ Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\) ⋮ A characterization of some distance-regular graphs by strongly closed subgraphs ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) ⋮ A distance-regular graph with strongly closed subgraphs
Cites Work
- The dual of Pasch's axiom
- Characterization of projective incidence structures
- On uniformly geodetic graphs
- A distance-regular graph with strongly closed subgraphs
- Distance-regular graphs and (s,c,a,k)-graphs
- On strongly closed subgraphs of highly regular graphs
- The nonexistence of certain generalized polygons
- Cubic Distance-Regular Graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
