Hamiltonian Subgraphs of Order Seven in srg(n,k,1,2)

2025/11/09 by Reimbayev, Reimbay
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · doi:10.48550/arxiv.2511.06572

openalex publication_date 2025/11/09 · openalex created_date 2025/11/12 · openalex updated_date 2026/07/28

Abstract

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.

Citations

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

Related

• The Subgraphs of Order Six of the Family of Strongly Regular Graphs with Parameters λ=1 and μ=2
• Large connected strongly regular graphs are Hamiltonian
• Hamiltonian cycles in 7-tough (P₄∪ P₁)-free graphs
• On the Minimum Number of Hamiltonian Cycles in Regular Graphs
• On the non-existence of srg(76,21,2,7)