A circuit chasing technique in a distance-regular graph with triangles

DOI10.1006/eujc.1993.1046zbMath0794.05133OpenAlexW1964185349MaRDI QIDQ1322409

Akira Hiraki

Publication date: 28 August 1994

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

Full work available at URL: https://doi.org/10.1006/eujc.1993.1046

zbMATH Keywords

distance-regular graphtrianglesintersection arraycircuit chasing

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (6)

On strongly closed subgraphs of highly regular graphs ⋮ Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) ⋮ Distance-regular subgraphs in a distance-regular graph. II ⋮ The regular near polygons of order \((s,2)\) ⋮ Distance-regular graphs of valency 6 and \(a_1=1\) ⋮ Retracing argument for distance-regular graphs

This page was built for publication: A circuit chasing technique in a distance-regular graph with triangles