Distance-regular graphs of diameter 3 without triangles with c₂=2
From MaRDI portal
Distance-regular graphs of diameter 3 without triangles with \(c 2=2\)
Recommendations
- On distance-regular graphs with \(c_2 = 2\)
- Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
- ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR GRAPHS
- Distance-regular graph with intersection array \(\{27, 20, 7; 1, 4, 21\}\) does not exist
- On geometric distance-regular graphs with diameter three
Cites work
- 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
- There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
Cited in
(8)- There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
- On distance-regular graphs with \(c_2 = 2\)
- On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
- On geometric distance-regular graphs with diameter three
- Triangle-free distance-regular graphs
- A note on triangle-free distance-regular graphs with \(a_2\neq 0\)
- Distance-Regular Graphs with Intersection Arrays {7,6,6;1,1,2} and {42,30,2;1,10,36} Do not Exist
- On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph
This page was built for publication: Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2100140)
