Quasi-strongly regular graphs of grade three with diameter two
Songpon Sriwongsa, Pawaton Kaemawichanurat

TL;DR
This paper investigates a specific class of quasi-strongly regular graphs of grade three with diameter two, establishing bounds on their order and characterizing graphs that meet these bounds.
Contribution
It provides sharp bounds on the order of quasi-strongly regular graphs of grade three with diameter two and characterizes all graphs that attain these bounds.
Findings
Established sharp bounds on the order n for given degree k.
Characterized all such graphs that meet the bounds.
Extended understanding of the structure of quasi-strongly regular graphs.
Abstract
A quasi-strongly regular graph of grade with parameters is a -regular graph of order such that any two adjacent vertices share common neighbours and any two non-adjacent vertices share common neighbours for some . This is a generalization of a strongly regular graph. In this paper, we focus on strictly quasi-strongly regular graphs of grade with for . The main result is to show the sharp bounds of order for a given . Furthermore, by this result, we characterize all of these graphs whose satisfies upper or lower bounds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
