The triangle-free Krein graph Kre(r) is strongly regular with parameters ((r2+3r)2,r3+3r2+r,0,r2+r). The existence of such graphs is known only for r=1 (the complement of the Clebsch graph) and r=2 (the Higman-Sims graph). A.L. Gavrilyuk and A.A. Makhnev proved that the graph Kre(3) does not exist. Later Makhnev proved that the graph Kre(4) does not exist. The graph Kre(r) is the only strongly regular triangle-free graph in which the antineighborhood of a vertex Kre(r)′ is strongly regular. The graph Kre(r)′ has parameters ((r2+2r−1)(r2+3r+1),r3+2r2,0,r2). This work clarifies Makhnev's result on graphs in which the neighborhoods of vertices are strongly regular graphs without 3-cocliques. As a consequence, it is proved that the graph Kre(r) exists if and only if the graph Kre(r)′ exists and is the complement of the block graph of the quasi-symmetric 2-design.
Translated title of the contributionOn graphs in which the neighborhoods of vertices are edge-regular graphs without 3-claws
Original languageRussian
Pages (from-to)279-282
Number of pages4
JournalТруды института математики и механики УрО РАН
Volume29
Issue number4
DOIs
Publication statusPublished - 2023

    ASJC Scopus subject areas

  • General Mathematics
  • Applied Mathematics
  • Computational Mechanics
  • Computer Science Applications

    WoS ResearchAreas Categories

  • Mathematics, Applied

    Level of Research Output

  • VAK List
  • Russian Science Citation Index

ID: 49875995