3-bounded property in a triangle-free distance-regular graph

DOI10.1016/j.ejc.2007.10.002zbMath1154.05027arXiv0709.0564OpenAlexW2159132539MaRDI QIDQ942133

Chih-Wen Weng, Yeh-Jong Pan

Publication date: 4 September 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

distance-regular graphweak-geodetically closed

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (3)

Further study of distance-regular graphs with classical parameters with \(b < -1\) ⋮ Nonexistence of a class of distance-regular graphs ⋮ A note on triangle-free distance-regular graphs with \(a_2\neq 0\)

Cites Work

• Unnamed Item
• Unnamed Item
• \(D\)-bounded distance-regular graphs
• The subconstituent algebra of an association scheme. I
• The structure of near polygons with quads
• Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)
• Near \(n\)-gons and line systems
• Weak-geodetically closed subgraphs in distance-regular graphs
• Classical distance-regular graphs of negative type
• A new inequality for distance-regular graphs
• On strongly closed subgraphs of highly regular graphs
• Strongly closed subgraphs in a regular thick near polygon
• Triangle-free distance-regular graphs
• STRONGLY CLOSED SUBGRAPHS OF A DISTANCE-REGULAR GRAPH WITH GEOMETRIC GIRTH FIVE

This page was built for publication: 3-bounded property in a triangle-free distance-regular graph