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

2024/09/16 by Reimbay Reimbayev, Reimbayev, Reimbay · 3 citations
Computer Science · Engineering · Mathematics · #05E30 (Primary) #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2409.10620

openalex publication_date 2024/09/16 · openalex created_date 2024/10/24 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• Hamiltonian Subgraphs of Order Seven in srg(n,k,1,2)
• Nonexistence of srg(19,6,1,2): Combinatorial Proof
• The Subgraphs of Order Six of the Family of Strongly Regular Graphs with Parameters λ=1 and μ=2

Related

• There is no strongly regular graph with parameters (460,153,32,60)
• Nonexistence of srg(19,6,1,2): Combinatorial Proof
• Strongly regular graphs with parameters (85,14,3,2) do not exist
• On the non-existence of srg(76,21,2,7)
• There is no (95,40,12,20) strongly regular graph