A new characterization of the dual polar graphs

DOI10.1016/J.JCTB.2018.08.003zbMath1404.05044arXiv1711.05874OpenAlexW2964165220WikidataQ129322706 ScholiaQ129322706MaRDI QIDQ1719579

Jack H. Koolen, Zhi Qiao

Publication date: 8 February 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.05874

zbMATH Keywords

distance-regular graphsdual polar graphsregular near polygonsgeometric distance-regular graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• There are only finitely many distance-regular graphs of fixed valency greater than two
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Inequalities for regular near polygons, with applications to \(m\)-ovoids
• A characterization of some distance-regular graphs by strongly closed subgraphs
• The structure of near polygons with quads
• A new inequality for bipartite distance-regular graphs.
• A valency bound for distance-regular graphs
• Strongly closed subgraphs in a regular thick near polygon
• Light tails and the Hermitian dual polar graphs
• The completion of the classification of the regular near octagons with thick quads

This page was built for publication: A new characterization of the dual polar graphs