

A051427


Number of strictly Deza graphs with n nodes.


0



0, 0, 0, 0, 0, 0, 0, 3, 2, 1, 0, 6, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,8


COMMENTS

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


REFERENCES

M. Erickson et al., Deza graphs: a generalization of strongly regular graphs, J. Comb. Des., 7 (1999), 395405.


LINKS

Table of n, a(n) for n=1..13.
M. Erickson, S. Fernando, W. H. Haemers, D. Hardy and J. Hemmeter, Deza graphs: A generalization of strongly regular graph, J. Combinatorial Designs, Vol 7, Issue 6, 395405, Oct 21, 1999.


CROSSREFS

Cf. A000517, A076434, A076435, A088741.
Sequence in context: A179753 A279318 A084269 * A194763 A194741 A194753
Adjacent sequences: A051424 A051425 A051426 * A051428 A051429 A051430


KEYWORD

nonn,nice


AUTHOR

N. J. A. Sloane


STATUS

approved



