arXiv:2105.11787 [math.CO]AbstractReferencesReviewsResources
Quasi-strongly regular graphs of grade three with diameter two
Songpon Sriwongsa, Pawaton Kaemawichanurat
Published 2021-05-25Version 1
A quasi-strongly regular graph of grade $p$ with parameters $(n, k, a; c_1, \ldots, c_p)$ is a $k$-regular graph of order $n$ such that any two adjacent vertices share $a$ common neighbours and any two non-adjacent vertices share $c_{i}$ common neighbours for some $1 \leq i \leq p$. This is a generalization of a strongly regular graph. In this paper, we focus on strictly quasi-strongly regular graphs of grade $3$ with $c_i = k - i$ for $i = 1, 2, 3$. The main result is to show the sharp bounds of order $n$ for a given $k \geq 4$. Furthermore, by this result, we characterize all of these graphs whose $n$ satisfies upper or lower bounds.
Categories: math.CO
Related articles: Most relevant | Search more
On the generalized (edge-)connectivity of graphs
Lower bounds for designs in symmetric spaces
arXiv:math/0410218 [math.CO] (Published 2004-10-08)
The sum of degrees in cliques