On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\)
From MaRDI portal
Publication:6089440
DOI10.1515/DMA-2023-0025zbMath1526.05139MaRDI QIDQ6089440
Mikhaĭl Petrovich Golubyatnikov, Aleksandr Alekseevich Makhnev
Publication date: 17 November 2023
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Association schemes, strongly regular graphs (05E30) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\)
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- Distance-regular Shilla graphs with \(b_2 = c_2\)
- On distance-regular graphs with \(c_2 = 2\)
- Automorphisms of small graphs 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\}\)
- Inverse problems in graph theory: nets
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)\}\)
