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...
Saved in:
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!
|
Similar Items
-
4-REGULAR GRAPH OF DIAMETER 2
by: Đỗ Như An, et al.
Published: (2013-06-01) -
On certain regular graphs of girth 5
by: M. O'keefe, et al.
Published: (1984-01-01) -
The matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01) -
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01) -
Remarks on μ″-measurbale sets: regularity, σ-smootheness, and measurability
by: Carman Vlad
Published: (1999-01-01)