Distance-regular Shilla graphs with b₂ = c₂

DOI10.1134/S0001434618050103zbMATH Open1394.05027OpenAlexW2811229877WikidataQ129647338 ScholiaQ129647338MaRDI QIDQ1668071FDOQ1668071

Authors Peng Zhang 

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

zbMATH Keywords

distance-regular graphgraph automorphismShilla graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• Shilla distance-regular graphs with \(b_2 = sc_2\)
• To the theory of Shilla graphs with \(b_2=c_2\)
• Shilla distance-regular graphs
• On \(Q \)-polynomial Shilla graphs with \(b=6 \)
• Three infinite families of Shilla graphs do not exist

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• 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
• Distance-regular graphs with or at least half the valency
• Extremal 1-codes in distance-regular graphs of diameter 3
• Shilla distance-regular graphs

Cited in

(20)

• Inverse problems in the class of distance-regular graphs of diameter 4
• Codes in Shilla distance-regular graphs
• Inverse problems in the theory of distance-regular graphs: dual 2-designs
• Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\)
• Shilla distance-regular graphs with \(b_2 = sc_2\)
• Three infinite families of Shilla graphs do not exist
• Inverse problems of graph theory: graphs without triangles
• On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\)
• On \(Q \)-polynomial Shilla graphs with \(b=6 \)
• Inverse problems in graph theory: nets
• SHILLA GRAPHS WITH \(b=5\) AND \(b=6\)
• Inverse problems in the theory of distance-regular graphs
• Some Schill graphs with \(b=4\) do not exist
• ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
• Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)
• Distance-regular graph with intersection array \(\{27, 20, 7; 1, 4, 21\}\) does not exist
• The largest Moore graph and a distance-regular graph with intersection array \(\{55, 54, 2; 1, 1, 54\}\)
• To the theory of Shilla graphs with \(b_2=c_2\)
• Inverse problems of graph theory: generalized quadrangles
• Shilla distance-regular graphs

This page was built for publication: Distance-regular Shilla graphs with \(b_2 = c_2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1668071)