On small distance-regular graphs with the intersection arrays \mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\

DOI10.1515/DMA-2023-0025MaRDI QIDQ6089440zbMATH OpenFDO

Authors Alexandre A. Makhnev, Mikhaĭl Petrovich Golubyatnikov

Publication date 17 November 2023

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA-2023-0025

zbMATH Keywords

distance-regular graphgraph \(\Gamma\) with strongly regular graph \(\Gamma_3\)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30)

Recommendations

• Inverse problems in the theory of distance-regular graphs
• Inverse problems in graph theory: nets
• Inverse problems in the theory of distance-regular graphs: dual 2-designs
• On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
• Inverse problems of graph theory: generalized quadrangles

Cites work

• Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\)
• Automorphisms of distance-regular graph with intersection array \(\{24,18,9;1,1,16\}\)
• Automorphisms of small graphs with intersection array \(\{nm-1, nm-n+m-1,n-m+1;1,1,nm-n+m-1\}\)
• Distance-regular Shilla graphs with b₂ = c₂
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Inverse problems in graph theory: nets
• On distance-regular graphs with \(c_2 = 2\)
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs

This page was built for publication: On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\)

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