%I
%S 0,0,0,0,0,0,0,3,2,1,0,6,1
%N Number of strictly Deza graphs with n nodes.
%C From the Erikson et al. paper: 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.  _Jonathan Vos Post_, Jul 06 2008
%D M. Erickson et al., Deza graphs: a generalization of strongly regular graphs, J. Comb. Des., 7 (1999), 395405.
%H M. Erickson, S. Fernando, W. H. Haemers, D. Hardy and J. Hemmeter, <a href="http://www3.interscience.wiley.com/journal/66003804/abstract?CRETRY=1&SRETRY=0">Deza graphs: A generalization of strongly regular graph</a>, J. Combinatorial Designs, Vol 7, Issue 6, 395405, Oct 21, 1999.
%Y Cf. A000517, A076434, A076435, A088741.
%K nonn,nice
%O 1,8
%A _N. J. A. Sloane_
