Published in

Wiley, Journal of Combinatorial Designs, 6(7), p. 395-405, 1999

DOI: 10.1002/(sici)1520-6610(1999)7:6<395::aid-jcd1>3.0.co;2-u

Wiley, Journal of Combinatorial Designs, 6(7), p. 395-405

DOI: 10.1002/(sici)1520-6610(1999)7:6<395::aid-jcd1>3.3.co;2-l

Links

Tools

Export citation

Search in Google Scholar

Deza graphs: A generalization of strongly regular graph

Journal article published in 1999 by M. Erickson, S. Fernando, W. H. Haemers, D. Hardy ORCID, J. Hemmeter
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

We consider the following generalization of strongly regular graphs. A graph G is a Deza graph if it is regular and the number of common neighbors of two distinct vertices takes on one of two values (not necessarily depending on the adjacency of the two vertices). We introduce several ways to construct Deza graphs, and develop some basic theory. We also list all diameter two Deza graphs which are not strongly regular and have at most 13 vertices.