Shilla distance-regular graphs with \(b_2 = sc_2\)

DOI10.1134/S0081543819070034zbMath1478.05036OpenAlexW3012750342MaRDI QIDQ2185639

Ivan Nikolaevich Belousov

Publication date: 5 June 2020

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543819070034

zbMATH Keywords

distance-regular graphgraph automorphism

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

SHILLA GRAPHS WITH \(b=5\) AND \(b=6\) ⋮ Three infinite families of Shilla graphs do not exist ⋮ Inverse problems in the theory of distance-regular graphs: dual 2-designs ⋮ Automorphisms of distance-regular graph with intersection array \(\{24,18,9;1,1,16\}\)

Cites Work

• Unnamed Item
• Shilla distance-regular graphs
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• To the theory of Shilla graphs with \(b_2=c_2\)

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