English

Quasi-strongly regular graphs of grade three with diameter two

Combinatorics 2021-05-26 v1

Abstract

A quasi-strongly regular graph of grade pp with parameters (n,k,a;c1,,cp)(n, k, a; c_1, \ldots, c_p) is a kk-regular graph of order nn such that any two adjacent vertices share aa common neighbours and any two non-adjacent vertices share cic_{i} common neighbours for some 1ip1 \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 33 with ci=kic_i = k - i for i=1,2,3i = 1, 2, 3. The main result is to show the sharp bounds of order nn for a given k4k \geq 4. Furthermore, by this result, we characterize all of these graphs whose nn satisfies upper or lower bounds.

Keywords

Cite

@article{arxiv.2105.11787,
  title  = {Quasi-strongly regular graphs of grade three with diameter two},
  author = {Songpon Sriwongsa and Pawaton Kaemawichanurat},
  journal= {arXiv preprint arXiv:2105.11787},
  year   = {2021}
}