Distance-regular Shilla graphs with \(b_2 = c_2\)
From MaRDI portal
Publication:1668071
DOI10.1134/S0001434618050103zbMath1394.05027OpenAlexW2811229877WikidataQ129647338 ScholiaQ129647338MaRDI QIDQ1668071
Publication date: 31 August 2018
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434618050103
Related Items (15)
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\) ⋮ Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\) ⋮ Inverse problems of graph theory: generalized quadrangles ⋮ Shilla distance-regular graphs with \(b_2 = sc_2\) ⋮ Inverse problems in the theory of distance-regular graphs ⋮ Inverse problems in graph theory: nets ⋮ On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\) ⋮ The largest Moore graph and a distance-regular graph with intersection array \(\{55, 54, 2; 1, 1, 54\}\) ⋮ Inverse problems of graph theory: graphs without triangles ⋮ Three infinite families of Shilla graphs do not exist ⋮ Codes in Shilla distance-regular graphs ⋮ Inverse problems in the theory of distance-regular graphs: dual 2-designs ⋮ DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST ⋮ Inverse problems in the class of distance-regular graphs of diameter 4 ⋮ Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)
Cites Work
- Unnamed Item
- Extremal 1-codes in distance-regular graphs of diameter 3
- Distance-regular graphs with or at least half the valency
- Shilla distance-regular graphs
- An automorphism group of a distance-regular graph with intersection array \(\{24, 21, 3; 1, 3, 18\}\)
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
This page was built for publication: Distance-regular Shilla graphs with \(b_2 = c_2\)
