|
%I #28 Dec 21 2020 17:13:42
%S 1,2,12,48,168,1152,9600,97920
%N Maximum number of graceful labelings for a simple graph on n nodes.
%C a(9) >= 1491840 (K_1,1,7).
%C Table of graphs achieving these maxima:
%C 1: K_1
%C 2: K_2 = P_2
%C 3: K_3 = C_3 = K_1,1,1
%C 4: K_4
%C 5: K_1,1,3
%C 6: K_1,1,4
%C 7: K_1,1,5
%C 8: K_1,1,6
%C 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.
%Y Cf. A334307, A339892.
%K nonn,more
%O 1,2
%A _Eric W. Weisstein_, Apr 03 2020
%E a(8) from _Eric W. Weisstein_, Jul 30 2020
|
