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.

No abstract

This reproduction was made from a copy o f a docum ent sent to us for microfilming. While the most advanced ter ' .iology has been used to photograph and reproduce this document, the quality c f the reproduction is heavily dependent upon the quality o f the material submitted. The following explanation of techniques is provided to help clarify markings or notations which may appear on this reproduction. 5. Some pages in any document may have indistinct print. In all cases the best available copy has been filmed.

No abstract

No abstract