Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)

DOI10.1016/0195-6698(95)90006-3zbMath0842.05029OpenAlexW159717946MaRDI QIDQ1898055

Norio Yamazaki

Publication date: 28 July 1996

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

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90006-3

zbMATH Keywords

distance-regular graphdistancecomplete graphsconnected graphgirths

Mathematics Subject Classification ID

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

Related Items (6)

Geometric distance-regular graphs without 4-claws ⋮ On geometric distance-regular graphs with diameter three ⋮ There are only finitely many distance-regular graphs of fixed valency greater than two ⋮ Distance-regular graphs without 4-claws ⋮ Distance-regular graphs of valency 6 and \(a_1=1\) ⋮ On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distance-regular graphs with fixed valency. II
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• A remark on the intersection arrays of distance-regular graphs
• Bipartite distance-regular graphs of valency three
• A circuit chasing technique in a distance-regular graph with triangles
• On distance-biregular graphs of girth divisible by four
• Distance-regular graphs of valency 6 and \(a_1=1\)
• Cubic Distance-Regular Graphs
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)