The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$

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 th...

Full description

Saved in:
Bibliographic Details
Main Author: Reimbay Reimbayev
Format: Article
Language:English
Published: EJAAM 2024-08-01
Series:E-Journal of Analysis and Applied Mathematics
Subjects:
Online Access:https://ejaam.org/articles/2024/10.62780-ejaam-2024-001.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2544-9990