|
%I #14 Apr 25 2020 03:54:40
%S 0,1,3,2,6,17,33,56,72,88,114,140,160,190,211,250,290,322,356,404,438,
%T 474,530,580,626,682,728
%N Number of n-node Steinhaus graphs whose complements have at least one cut-vertex.
%D 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.
%H W. Dymacek, T. Whaley, <a href="https://doi.org/10.1016/0012-365X(93)E0211-L">Generating strings for bipartite Steinhaus graphs</a>, Discrete Math. 141 (1995), pages 97-107.
%K nonn,more
%O 1,3
%A Wayne M. Dymacek (dymacek(AT)fs.sciences.wlu.edu)
%E a(23)-a(27) from _Sean A. Irvine_, Feb 04 2018
|
