Pith. sign in

REVIEW

Quasi-strongly regular graphs of grade three with diameter two

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.11787 v1 pith:7Y2XJW26 submitted 2021-05-25 math.CO

Quasi-strongly regular graphs of grade three with diameter two

classification math.CO
keywords regulargradegraphgraphsquasi-stronglyboundscommonneighbours
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.