A379395 Maximum number of fundamentally different graceful labelings for a simple graph of n nodes.

1, 1, 1, 5, 26, 126, 680, 3876

Offset: 1

Author

Eric W. Weisstein, Dec 22 2024

Keywords

• nonn
• more

Comments

The difference between "fundamentally different graceful labelings" of a graph and "graceful labelings" of a graph is that the latter is the former multiplied by twice the number of automorphisms. (The extra factor of 2 comes from complementation.)

a(9) >= 25501. - Eric W. Weisstein, Mar 30 2025

Links

• Eric Weisstein's World of Mathematics, Graceful Labeling.
• Eric Weisstein's World of Mathematics, Maximally Graceful Graph.
• Eric Weisstein's World of Mathematics, Simple Graph.

Crossrefs

Cf. A339892 (maximum number of fundamentally different graceful labelings excluding graphs with isolated vertices).