Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.10620 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909317734596608 |
|---|---|
| author | Reimbayev, Reimbay |
| author_facet | Reimbayev, Reimbay |
| contents | 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 $λ=1$ and $μ=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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_10620 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Lower Bound for Number of Hexagons in Strongly Regular Graphs with Parameters $λ=1$ and $μ=2$ Reimbayev, Reimbay Combinatorics 05E30 (Primary) 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 $λ=1$ and $μ=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. |
| title | The Lower Bound for Number of Hexagons in Strongly Regular Graphs with Parameters $λ=1$ and $μ=2$ |
| topic | Combinatorics 05E30 (Primary) |
| url | https://arxiv.org/abs/2409.10620 |