Retracing argument for distance-regular graphs
From MaRDI portal
Publication:1850478
DOI10.1006/jctb.2000.1961zbMath1028.05116OpenAlexW1979319544MaRDI QIDQ1850478
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1961
Related Items (2)
Applications of the retracing method for distance-regular graphs ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)
Cites Work
- A remark on the intersection arrays of distance-regular graphs
- A circuit chasing technique in a distance-regular graph with triangles
- An improvement of the Boshier-Nomura bound
- Applications of the retracing method for distance-regular graphs
- Distance-regular subgraphs in a distance-regular graph. III
- Distance-regular subgraphs in a distance-regular graph. I
- Distance-regular subgraphs in a distance-regular graph. II
- Cubic Distance-Regular Graphs
- Unnamed Item
This page was built for publication: Retracing argument for distance-regular graphs
