Parallelogram-free distance-regular graphs

DOI10.1006/jctb.1997.1787zbMath0906.05080OpenAlexW2074607132MaRDI QIDQ1386435

Chih-Wen Weng, Yuh-Jeng Liang

Publication date: 5 August 1998

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

Full work available at URL: https://doi.org/10.1006/jctb.1997.1787

zbMATH Keywords

distance-regular graphsparallelograms in graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (3)

On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ Nonexistence of a class of distance-regular graphs ⋮ Triangle-free distance-regular graphs

Cites Work

• Unnamed Item
• The subconstituent algebra of an association scheme. I
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• Weak-geodetically closed subgraphs in distance-regular graphs
• A new inequality for distance-regular graphs
• Kite-free \(P\)- and \(Q\)-polynomial schemes
• Kite-free distance-regular graphs
• Twice Q-polynomial distance-regular graphs are thin
• Orthogonal Polynomials, Duality and Association Schemes

This page was built for publication: Parallelogram-free distance-regular graphs