Inverse problems in the theory of distance-regular graphs
From MaRDI portal
Publication:2185643
DOI10.1134/S0081543819070071zbMATH Open1441.05247OpenAlexW2890348677MaRDI QIDQ2185643FDOQ2185643
Authors: Alexandre A. Makhnev, Dmitriĭ Viktorovich Paduchikh 
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/s0081543819070071
Recommendations
- Inverse problems of graph theory: generalized quadrangles
- Inverse problems of graph theory: graphs without triangles
- Inverse problems in the theory of distance-regular graphs: dual 2-designs
- Inverse problems in graph theory: nets
- Inverse problems in the class of distance-regular graphs of diameter 4
Cites Work
- Title not available (Why is that?)
- Shilla distance-regular graphs
- Triple intersection numbers of \(Q\)-polynomial distance-regular graphs
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
- Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
- Extremal 1-codes in distance-regular graphs of diameter 3
- Distance-regular graph with the intersection array \(\{45, 30, 7; 1, 2, 27\}\) does not exist
- Distance-regular Shilla graphs with \(b_2 = c_2\)
- On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
- Correction to: ``A new distance-regular graph of diameter 3 on 1024 vertices
Cited In (13)
- On an extremal inverse problem in graph theory
- Inverse problems on graphs: recovering the tree of strings by the BC-method
- Inverse problems of graph theory: graphs without triangles
- The inverse Voronoi problem in graphs. I: Hardness
- Inverse Problems and Zero Forcing for Graphs
- ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
- On the graph condition regarding the \(F\)-inverse cover problem
- Inverse problems in graph theory: nets
- Inverse problems in the theory of distance-regular graphs: dual 2-designs
- Inverse problems of graph theory: generalized quadrangles
- On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\)
- Inverse problems on a graph with loops
- Inverse problems in the class of distance-regular graphs of diameter 4
This page was built for publication: Inverse problems in the theory of distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185643)
