Hamiltonian Subgraphs of Order Seven in $srg(n,k,1,2)$
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908640131153920 |
|---|---|
| author | Reimbayev, Reimbay |
| author_facet | Reimbayev, Reimbay |
| contents | Strongly regular graphs are highly symmetrical and can be described fully with just a few parameters, yet the existence of many of them is still under the question. In this paper, we continue the study of the famuly of strongly regular graphs with parameters $λ=1$ and $μ=2$ and establish all of their possible Hamiltonian subgraphs of order seven. By doing so we establish the lower and upper bounds for number of 7-gons, or 7-cycles, in such graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_06572 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hamiltonian Subgraphs of Order Seven in $srg(n,k,1,2)$ Reimbayev, Reimbay Combinatorics Strongly regular graphs are highly symmetrical and can be described fully with just a few parameters, yet the existence of many of them is still under the question. In this paper, we continue the study of the famuly of strongly regular graphs with parameters $λ=1$ and $μ=2$ and establish all of their possible Hamiltonian subgraphs of order seven. By doing so we establish the lower and upper bounds for number of 7-gons, or 7-cycles, in such graphs. |
| title | Hamiltonian Subgraphs of Order Seven in $srg(n,k,1,2)$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2511.06572 |