Skip to main content
Log in

On Graphs in Which the Neighborhoods of Vertices Are Edge-Regular Graphs without 3-Claws

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

The triangle-free Krein graph Kre\((r)\) is strongly regular with parameters \(((r^{2}+3r)^{2},\)\(r^{3}+3r^{2}+r,0,r^{2}+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)^{\prime}\) is strongly regular. The graph Kre\((r)^{\prime}\) has parameters \(((r^{2}+2r-1)(r^{2}+3r+1),r^{3}+2r^{2},0,r^{2})\). 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)^{\prime}\) exists and is the complement of the block graph of a quasi-symmetric \(2\)-design.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

REFERENCES

  1. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs (Springer, Berlin, 1989).

    Book  Google Scholar 

  2. A. L. Gavrilyuk and A. A. Makhnev, “On Krein graphs without triangles,” Dokl. Math. 72 (1), 591–594 (2005).

    Google Scholar 

  3. A. A. Makhnev, “The graph Kre\((4)\) does not exist,” Dokl. Math. 96 (1), 348–350 (2017). https://doi.org/10.1134/S1064562417040123

    Article  MathSciNet  Google Scholar 

  4. A. A. Makhnev, “On a class of graphs without 3-stars,” Math. Notes 63 (3), 357–362 (1998). https://doi.org/10.1007/BF02317782

    Article  MathSciNet  Google Scholar 

  5. P. Cameron and J. H. van Lint, Designs, Graphs, Codes and Their Links (Cambridge Univ. Press, Cambridge, 1991), Ser. London Math. Soc. Student Texts, Vol. 22.

    Book  Google Scholar 

Download references

Funding

This research was supported by the National Natural Science Foundation of China (project no. 12171126) and by a grant from the Engineering Modeling and Statistical Computing Laboratory of the Hainan Province.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to M. Chen, A. A. Makhnev or M. S. Nirova.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Translated from Trudy Instituta Matematiki i Mekhaniki UrO RAN, Vol. 29, No. 4, pp. 279 - 282, 2023 https://doi.org/10.21538/0134-4889-2023-29-4-279-282.

Translated by E. Vasil’eva

Publisher's Note Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, M., Makhnev, A.A. & Nirova, M.S. On Graphs in Which the Neighborhoods of Vertices Are Edge-Regular Graphs without 3-Claws. Proc. Steklov Inst. Math. 323 (Suppl 1), S53–S55 (2023). https://doi.org/10.1134/S0081543823060044

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543823060044

Keywords

Navigation