The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051427 Number of strictly Deza graphs with n nodes. 0


%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), 395-405.

%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&amp;SRETRY=0">Deza graphs: A generalization of strongly regular graph</a>, J. Combinatorial Designs, Vol 7, Issue 6, 395-405, Oct 21, 1999.

%Y Cf. A000517, A076434, A076435, A088741.

%K nonn,nice

%O 1,8

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 23:00 EDT 2021. Contains 345402 sequences. (Running on oeis4.)