REVIEW 1 cited by
Deza graphs: a survey and new results
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
abstract
In this paper we survey existing results on Deza graphs and give some new results. We present an introduction to Deza graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of Deza graphs since the initial paper by five authors [M. Erickson, S. Fernando, W. H. Haemers, D. Hardy, J. Hemmeter, Deza graphs: \emph{A generalization of strongly regular graphs}, J. Comb. Designs. 7 (1999), 395--405.] was written. We then investigate 3-class cyclotomic schemes and give necessary and sufficient conditions to get a Deza graph as a graph given by one relation or the union of two relations. Finally, we prove that a strictly Deza circulant on $2p$ vertices, where $p$ is prime, is isomorphic to the lexicographical product of the Paley graph on $p$ vertices with an edge.
Forward citations
Cited by 1 Pith paper
-
Classification of polyhedral graphs by numbers of common neighbours
Every polyhedron is classified by its set of pair common-neighbour counts, with a complete trichotomy for every finite set of counts.
Discussion (0). Continue with ORCID to comment.