### DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST

#### Abstract

In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \(\{18,14,5;1,2,14\}\), \(\{18,15,9;1,1,10\}\), \(\{21,16,10;1,2,12\}\), \(\{24,21,3;1,3,18\}\), and \(\{27,20,7;1,4,21\}\). Automorphisms of graphs with intersection arrays \(\{18,15,9;1,1,10\}\) and \(\{24,21,3;1,3,18\}\) were found earlier by A.A. Makhnev and D.V. Paduchikh. In this paper, it is proved that a graph with the intersection array \(\{27,20,7;1,4,21\}\) does not exist.

#### Keywords

#### Full Text:

PDF#### References

Brouwer A.E., Cohen A.M., Neumaier A. *Distance-Regular Graphs. * Berlin, Heidelberg: Springer-Verlag, 1989. 495 p. DOI: 10.1007/978-3-642-74341-2

Jurišić A., Vidali J. Extremal 1-codes in distance-regular graphs of diameter 3. *Des. Codes Cryptogr.*, 2012. Vol. 65. P. 29–47. DOI: 10.1007/s10623-012-9651-0

Makhnev A.A., Nirova M.S. Distance-regular Shilla graphs with \(b_2=c_2\). *Math. Notes*, 2018. Vol. 103, No. 5–6. P. 780–792. DOI: 10.1134/S0001434618050103

Makhnev A.A., Paduchikh D.V. An automorphism group of a distance-regular graph with intersection array \(\{24,21,3;1,3,18\}\). *Algebra Logic*, 2012. Vol. 51, No. 4. P. 319–332. DOI: 10.1007/s10469-012-9194-5

Makhnev A.A., Paduchikh D.V. On automorphisms of distance-regular graph with intersection array \(\{18,15,9;1,1,10\}\). *Commun. Math. Stat.*, 2015. Vol. 3, No. 4. P. 527–534. DOI: 10.1007/s40304-015-0072-z

#### Article Metrics

### Refbacks

- There are currently no refbacks.