Distance-regular graphs with complete multipartite \(\mu\)-graphs and AT4 family
From MaRDI portal
Publication:884815
DOI10.1007/s10801-006-0046-zzbMath1117.05111OpenAlexW2059139079MaRDI QIDQ884815
Aleksandar Jurišić, Jack H. Koolen
Publication date: 7 June 2007
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-006-0046-z
Related Items (4)
Classification of the family AT4(\(qs,q,q\)) of antipodal tight graphs ⋮ A new feasibility condition for the AT4 family ⋮ The prime spectrum of an automorphism group of an 𝐴𝑇4(𝑝,𝑝+2,𝑟)-graph ⋮ On graphs with complete multipartite \(\mu \)-graphs
Uses Software
Cites Work
- Characterization of the Patterson graph
- Some polar towers
- Homogeneous graphs and regular near polygons
- Three new distance-regular graphs
- Krein parameters and antipodal tight graphs with diameter 3 and 4
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Nonexistence of some antipodal distance-regular graphs of diameter four
- Tight distance-regular graphs
- An existence lemma for groups generated by \(3\)-transpositions
- AT4 family and 2-homogeneous graphs
- An algorithmic approach to fundamental groups and covers of combinatorial cell complexes
- A local approach to 1-homogeneous graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distance-regular graphs with complete multipartite \(\mu\)-graphs and AT4 family
