login
A333728
Maximum number of graceful labelings for a simple graph on n nodes.
2
1, 2, 12, 48, 168, 1152, 9600, 97920
OFFSET
1,2
COMMENTS
a(9) >= 1491840 (K_1,1,7).
Table of graphs achieving these maxima:
1: K_1
2: K_2 = P_2
3: K_3 = C_3 = K_1,1,1
4: K_4
5: K_1,1,3
6: K_1,1,4
7: K_1,1,5
8: K_1,1,6
a(4) fails to correspond to the diamond graph K_1,1,2 since K_4 has 48 graceful labelings, while K_1,1,2 has only 32.
CROSSREFS
Sequence in context: A048501 A001815 A347324 * A354131 A370696 A052569
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Apr 03 2020
EXTENSIONS
a(8) from Eric W. Weisstein, Jul 30 2020
STATUS
approved