There exists no distance-regular graph with intersection array\n 56,36,9;1,3,48

2010/11/20 by Alexander L. Gavrilyuk, Gavrilyuk, Alexander L.
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.1011.4581

openalex publication_date 2010/11/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove that a distance-regular graph with intersection array\n56,36,9;1,3,48 does not exist. This intersection array is from the table of\nfeasible parameters for distance-regular graphs in "Distance-regular graphs" \nby A.E. Brouwer, A.M. Cohen, A. Neumaier.\n

Related

• There exists no distance-regular graph with intersection array 55,36,11;1,4,45
• There does not exist a distance-regular graph with intersection array\n 80, 54,12; 1, 6, 60
• The uniqueness of a distance-regular graph with intersection array\n 32,27,8,1;1,4,27,32 and related results
• A relationship between the diameter and the intersection number c2 for a distance-regular graph
• Distance-regular graphs admitting a perfect 1-code