There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)
The electronic journal of combinatorics, Tome 29 (2022) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we show that there does not exist a strongly regular graph with parameters $(1911, 270, 105, 27)$.
DOI : 10.37236/10675
Classification : 05E30, 05C50
Mots-clés : strongly regular graphs, non-existence, smallest eigenvalue, interlacing

Jack Koolen  1   ; Brhane Gebremichel  1

1 University of Science and Technology of China
@article{10_37236_10675,
     author = {Jack Koolen and Brhane Gebremichel},
     title = {There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {2},
     doi = {10.37236/10675},
     zbl = {1491.05201},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10675/}
}
TY  - JOUR
AU  - Jack Koolen
AU  - Brhane Gebremichel
TI  - There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10675/
DO  - 10.37236/10675
ID  - 10_37236_10675
ER  - 
%0 Journal Article
%A Jack Koolen
%A Brhane Gebremichel
%T There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/10675/
%R 10.37236/10675
%F 10_37236_10675
Jack Koolen; Brhane Gebremichel. There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\). The electronic journal of combinatorics, Tome 29 (2022) no. 2. doi: 10.37236/10675

Cité par Sources :