|
|
A007812
|
|
Number of n-node Steinhaus graphs whose complements have at least one cut-vertex.
|
|
0
|
|
|
0, 1, 3, 2, 6, 17, 33, 56, 72, 88, 114, 140, 160, 190, 211, 250, 290, 322, 356, 404, 438, 474, 530, 580, 626, 682, 728
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
REFERENCES
|
W. M. Dymacek, M. Koerlin, T. Whaley, A survey of Steinhaus graphs, Proc. 8th Quadrennial International Conf. on Graph Theory, Combinatorics, Algorithms and Application, Kalamazoo, Mich. 1996, pages 313-323, Vol. I.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Wayne M. Dymacek (dymacek(AT)fs.sciences.wlu.edu)
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|