|
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| Cf. W. Dymacek, T. Whaley, Generating strings for bipartite Steinhaus graphs, Discrete Math. 141 (1995), pages 97-107.
Cf. 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.
|
|
|
CROSSREFS
| Sequence in context: A078091 A073883 A074718 * A082561 A110768 A140230
Adjacent sequences: A007809 A007810 A007811 * A007813 A007814 A007815
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Wayne M. Dymacek [ DYMACEK(AT)fs.sciences.WLU.EDU ]
|
| |
|
|
