Distance-regular graphs without 4-claws

DOI10.1016/j.ejc.2018.02.022zbMath1415.05043arXiv1706.06036OpenAlexW2963710903WikidataQ130181602 ScholiaQ130181602MaRDI QIDQ2311358

Jack H. Koolen, Sejeong Bang, Alexander L. Gavrilyuk

Publication date: 10 July 2019

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

Full work available at URL: https://arxiv.org/abs/1706.06036

zbMATH Keywords

Delsarte bound\(t\)-claw

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (1)

On bounding the diameter of a distance-regular graph

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• Asymptotic Delsarte cliques in distance-regular graphs
• There are only finitely many distance-regular graphs of fixed valency greater than two
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Distance-regular graphs with or at least half the valency
• Shilla distance-regular graphs
• Delsarte clique graphs
• Improvement of Bruck's completion theorem
• Line graphs, root systems, and elliptic geometry
• Strongly regular graphs with smallest eigenvalue -m
• Determination of the distance-regular graphs without 3-claws
• Distance-regular graphs of valency 6 and \(a_1=1\)
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Geometric distance-regular graphs without 4-claws
• Non-existence of (76,30,8,14) strongly regular graph
• Distance-regular graphs of diameter 3 having eigenvalue \(-1\)
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• On geometric distance-regular graphs with diameter three
• Nonisomorphic Steiner triple systems
• Strongly regular graphs, partial geometries and partially balanced designs
• Faster Canonical Forms for Primitive Coherent Configurations
• A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
• Cubic Distance-Regular Graphs
• Eigenvectors of Distance-Regular Graphs
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• On separated graphs with certain regularity conditions
• Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist

This page was built for publication: Distance-regular graphs without 4-claws