Applications of the retracing method for distance-regular graphs

DOI10.1016/j.ejc.2004.04.003zbMath1060.05103OpenAlexW1979645423MaRDI QIDQ1775035

Akira Hiraki

Publication date: 4 May 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.04.003

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (4)

A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers ⋮ Applications of the retracing method for distance-regular graphs ⋮ A characterization of some distance-regular graphs by strongly closed subgraphs ⋮ Retracing argument for distance-regular graphs

Cites Work

• Unnamed Item
• A remark on the intersection arrays of distance-regular graphs
• The dual of Pasch's axiom
• Characterization of projective incidence structures
• On uniformly geodetic graphs
• Applications of the retracing method for distance-regular graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• Retracing argument for distance-regular graphs
• A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
• Intersection diagrams of distance-biregular graphs
• Cubic Distance-Regular Graphs

This page was built for publication: Applications of the retracing method for distance-regular graphs