Distance-regular graphs without 4-claws

2017/06/19 by Sejeong Bang, Bang, Sejeong, Alexander L. Gavrilyuk +3
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1706.06036

openalex publication_date 2017/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We determine the distance-regular graphs with diameter at least 3 and c₂≥ 2 but without induced K_1,4-subgraphs.

Related

• Geometric distance-regular graphs without 4-claws
• Non-geometric distance-regular graphs of diameter at least 3 with smallest eigenvalue at least -3
• Distance-regular graph with large a1 or c2
• On Distance-Regular Graphs with Smallest Eigenvalue at Least -m
• A relationship between the diameter and the intersection number c2 for a distance-regular graph