Quasi-strongly regular graphs of grade three with diameter two
Abstract
A quasi-strongly regular graph of grade p with parameters (n, k, a; c1, …, cp) 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 ci common neighbours for some 1 ≤ i ≤ 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 ci = k - i for i = 1, 2, 3. The main result is to show the sharp bounds of order n for a given k ≥ 4. Furthermore, by this result, we characterize all of these graphs whose n satisfies upper or lower bounds.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.