A387829 Number of fundamentally different graceful labelings of the n X n rook graph.

1, 1, 0, 11, 0

Offset

1,4

Comments

a(n) = 0 for n = 3 (mod 4) since those correspond to Eulerian graphs with edge count = 2 (mod 4). - Eric W. Weisstein, Sep 27 2025

Links

Table of n, a(n) for n=1..5.

Eric Weisstein's World of Mathematics, Graceful Labeling.

Eric Weisstein's World of Mathematics, Rook Graph.

Crossrefs

Sequence in context: A131679 A259391 A279540 * A321538 A321803 A321797

Adjacent sequences: A387826 A387827 A387828 * A387830 A387831 A387832

Keyword

nonn,hard,more

Author

Eric W. Weisstein, Sep 09 2025

Status

approved