Distance-Regular Graphs of Diameter 3 Without Triangles with $c_2=2$
A. A. Makhnev , Wenbin Guo , K. S. Efimov
Communications in Mathematics and Statistics ›› 2022, Vol. 10 ›› Issue (4) : 785 -792.
Distance-Regular Graphs of Diameter 3 Without Triangles with $c_2=2$
Earlier it was proved that some distance-regular graphs of diameter 3 with $c_2=2$ do not exist. Distance-regular graph $\varGamma $ with intersection array $\{17,16,10;1,2,8\}$ has strongly regular graph $\varGamma _{3}$ (pseudo-geometric graph for the net $pG_9(17,9)$). By symmetrizing the arrays of triple intersection numbers, it is proved that the distance-regular graphs with intersection arrays $\{17,16,10;1,2,8\}$ and $\{22,21,4;1,2,14\}$ do not exist.
Distance-regular graph / Graph without triangles / Triple intersection numbers
/
| 〈 |
|
〉 |
PDF
