arXiv Analytics

Sign in

arXiv:2409.10620 [math.CO]AbstractReferencesReviewsResources

The Lower Bound for Number of Hexagons in Strongly Regular Graphs with Parameters $λ=1$ and $μ=2$

Reimbay Reimbayev

Published 2024-09-16Version 1

The existence of $srg(99,14,1,2)$ has been a question of interest for several decades to the moment. In this paper we consider the structural properties in general for the family of strongly regular graphs with parameters $\lambda =1$ and $\mu =2$. In particular, we establish the lower bound for the number of hexagons and, by doing that, we show the connection between the existence of the aforementioned graph and the number of its hexagons.

Comments: 13 pages, 3 figures
Categories: math.CO
Subjects: 05E30
Related articles: Most relevant | Search more
arXiv:1111.0587 [math.CO] (Published 2011-11-02)
Structures and lower bounds for binary covering arrays
arXiv:2206.04815 [math.CO] (Published 2022-06-09)
Connections between graphs and matrix spaces
arXiv:1207.3319 [math.CO] (Published 2012-07-13)
Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions