Inverse problems in the class of distance-regular graphs of diameter 4
From MaRDI portal
Publication:2095491
Recommendations
- Inverse problems in the theory of distance-regular graphs
- Antipodal Krein graphs and distance-regular graphs close to them
- Inverse problems of graph theory: generalized quadrangles
- Inverse problems of graph theory: graphs without triangles
- Krein parameters and antipodal tight graphs with diameter 3 and 4
Cites work
- Automorphisms of an \(AT4(4, 4, 2)\)-graph and of the corresponding strongly regular graphs
- Classification of the family AT4(qs,q,q) of antipodal tight graphs
- Distance-regular Shilla graphs with b₂ = c₂
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- On Krein graphs without triangles
- On strongly regular graphs with eigenvalue \(\mu\) and their extensions
- The graph \(\operatorname{Kre}(4)\) does not exist
- The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
- Tight distance-regular graphs
- Using symbolic computation to prove nonexistence of distance-regular graphs
Cited in
(9)- Inverse problems of graph theory: generalized quadrangles
- Inverse problems in the theory of distance-regular graphs
- Inverse problems of graph theory: graphs without triangles
- Antipodal Krein graphs and distance-regular graphs close to them
- Inverse problems in graph theory: nets
- Classification of the family AT4(qs,q,q) of antipodal tight graphs
- On Krein graphs without triangles
- On graphs in which the neighborhoods of vertices are edge-regular graphs without 3-claws
- Graphs \(\Gamma\) of diameter 4 for which \(\Gamma_{3,4}\) is a strongly regular graph with \(\mu=4,6\)
This page was built for publication: Inverse problems in the class of distance-regular graphs of diameter 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095491)
