

A329788


Total number of graceful labelings of connected graphs with n edges.


2



1, 2, 6, 24, 116, 672, 4520, 35050, 303468, 2934652, 31145346, 361323708, 4535359000, 61431851046, 890284097146, 13784350300996
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

In general, consider a connected graph with E edges and V vertices. The vertices are given labels in the range 0 to E so that the differences between edges' endpoints are {1,...,E}. None of the vertices are isolated; hence each vertex label participates in at least one edge. For this sequence V is unrestricted and E = n.


LINKS

Table of n, a(n) for n=1..16.
D. E. Knuth, Program for counting graceful graph labelings.


CROSSREFS

Cf. A033472 (V=E+1), A329789 (V=E). A diagonal of the triangle in A329790.
Sequence in context: A324130 A324131 A221988 * A177518 A319027 A228397
Adjacent sequences: A329785 A329786 A329787 * A329789 A329790 A329791


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane, Dec 01 2019, based on email from Don Knuth, Dec 01 2019


STATUS

approved



