A007812 Number of n-node Steinhaus graphs whose complements have at least one cut-vertex.

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

Offset: 1

Author

Wayne M. Dymacek (dymacek(AT)fs.sciences.wlu.edu)

Keywords

• nonn
• more

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

• W. Dymacek, T. Whaley, Generating strings for bipartite Steinhaus graphs, Discrete Math. 141 (1995), pages 97-107.

Extensions

a(23)-a(27) from Sean A. Irvine, Feb 04 2018