Distance-regular graphs with intersection arrays \(\{55, 36, 11; 1, 4, 45\}\) and \(\{56, 36, 9; 1, 3, 48\}\) do not exist. (English. Russian original) Zbl 1283.05232
Dokl. Math. 84, No. 1, 444-446 (2011); translation from Dokl. Akad. Nauk 439, No. 1, 14-17 (2011).
MSC:
| 05C75 | Structural characterization of families of graphs |
| 05E30 | Association schemes, strongly regular graphs |
| 05C12 | Distance in graphs |
References:
| [1] | A. E. Brouwer, A. M. Cohen, A. Neumaier, Distance-Regular Graphs (Springer-Verlag, Berlin, 1989). · Zbl 0747.05073 |
| [2] | J. H. Koolen and J. Park, Eur. J. Combin. 31, 2064–2073 (2010). · Zbl 1221.05117 · doi:10.1016/j.ejc.2010.05.012 |
| [3] | C. D. Godsil, New Zealand J. Math. 22, 31–38 (1993). |
| [4] | R. Diestel, Graph Theory (Springer-Verlag, Berlin, 2005). |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
