

A335619


Number of fundamentally different graceful labelings of the complete bipartite graph K_{n,n}.


1



1, 1, 4, 1, 7, 2, 10, 3, 8, 1, 42, 2, 7, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,3


LINKS



FORMULA



EXAMPLE

a(3) = 4 because there are 4 fundamentally different graceful labelings:
solution #1:
0 1 4 5
6 8 14 16
solution #2:
0 1 8 9
10 12 14 16
solution #3:
0 1 2 15
5 9 13 16
solution #4
0 1 2 3:
4 8 12 16
All others can be obtained by permutations of left and right vertices, swapping halves ("0" vertex left or right) and the replacement of all vertex labels k by N^2k.  noted by Bert Dobbelaere, Oct 01 2020


CROSSREFS

Cf. A337793 (total number of graceful labelings).


KEYWORD

nonn,more


AUTHOR



EXTENSIONS



STATUS

approved



