Distance-regular graphs of valency 6 and \(a_1=1\)

DOI10.1023/A:1008776031839zbMath0966.05082OpenAlexW118621918MaRDI QIDQ1575097

Hiroshi Suzuki, Akira Hiraki, Nomura, Kazumasa

Publication date: 23 November 2000

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

Full work available at URL: https://doi.org/10.1023/a:1008776031839

zbMATH Keywords

association schemedistance-regular graphs\(P\)-polynomial scheme

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (9)

On strongly closed subgraphs of highly regular graphs ⋮ Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) ⋮ 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 ⋮ The regular near polygons of order \((s,2)\) ⋮ Distance-regular Cayley graphs with small valency ⋮ Distance-regular graphs without 4-claws ⋮ 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
• Unnamed Item
• Unnamed Item
• On distance-regular graphs with fixed valency
• 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
• On distance-regular graphs with fixed valency. IV
• Bipartite distance-regular graphs of valency three
• Bounding the diameter of a distance regular graph by a function of \(k_ d\)
• A circuit chasing technique in a distance-regular graph with triangles
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Cubic Distance-Regular Graphs

This page was built for publication: Distance-regular graphs of valency 6 and \(a_1=1\)