OFFSET
1,18
COMMENTS
A vertex-coloring of a graph G is called distinguishing if it is only preserved by the identity automorphism of G. This notion is considered in the subject of symmetry breaking of simple (finite or infinite) graphs. Two vertex-colorings of a graph are called equivalent if there is an automorphism of the graph which preserves the colors of the vertices. Given a graph G, we use the notation Phi_k(G) to denote the number of non-equivalent distinguishing colorings of G with at most k colors. The sequence here, displays A(n,k)=Phi_k(C_n), i.e., the number of non-equivalent distinguishing colorings of the cycle C_n on n vertices with at most k colors.
LINKS
B. Ahmadi, F. Alinaghipour and M. H. Shekarriz, Number of Distinguishing Colorings and Partitions, arXiv:1910.12102 [math.CO], 2019.
FORMULA
EXAMPLE
The table begins:
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 1, 4, 10, 20, 35, 56, 84, 120, ...
0, 0, 3, 15, 45, 105, 210, 378, 630, 990, ...
0, 0, 12, 72, 252, 672, 1512, 3024, 5544, 9504, ...
0, 1, 37, 266, 1120, 3515, 9121, 20692, 42456, 80565, ...
0, 2, 117, 1044, 5270, 19350, 57627, 147752, 338364, 709290, ...
0, 6, 333, 3788, 23475, 102690, 355446, 1039248, 2673810, 6222150, ...
0, 14, 975, 14056, 106950, 555990, 2233469, 7440160, 21493836, 55505550, ...
0, 30, 2712, 51132, 483504, 3009426, 14089488, 53611992, 174189024, 499720518, ...
------
For n=4, we can color the vertices of the cycle C_4 with at most 3 colors, in 3 ways, such that all the colorings distinguish the graph (i.e., no non-identity automorphism of C_4 preserves the coloring) and that all the three colorings are non-equivalent. The color classes are as follows:
{ { 1 }, { 2 }, { 3, 4 } }
{ { 1 }, { 2, 3 }, { 4 } }
{ { 1, 2 }, { 3 }, { 4 } }
PROG
(PARI) A(n, k)={sumdiv(n, d, moebius(n/d)*(k^d/n - if(d%2, k^((d+1)/2), (k+1)*k^(d/2)/2)))/2} \\ Andrew Howroyd, Aug 11 2019
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Bahman Ahmadi, Aug 06 2019
STATUS
approved