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
-
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01) -
𝕮-inverse of graphs and mixed graphs
by: Alomari Omar, et al.
Published: (2025-02-01) -
Introduction to graph theory /
by: West, Douglas Brent
Published: (2018) -
KGRDR: a deep learning model based on knowledge graph and graph regularized integration for drug repositioning
by: Huimin Luo, et al.
Published: (2025-02-01) -
Edge-level multi-constranint graph pattern matching with lung cancer knowledge graph
by: Houdie Tu, et al.
Published: (2025-02-01)