Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

Counting symmetric colorings of G×2

    https://doi.org/10.1142/S0219498819501998Cited by:0 (Source: Crossref)

    Let G be a finite group and let r. An r-coloring of G is any mapping χ:G{1,,r}. A coloring χ is symmetric if there is gG such that χ(gx1g)=χ(x) for every xG. We show that if G is Abelian and f(r) is the polynomial representing the number of symmetric r-colorings of G, then the number of symmetric r-colorings of G×2 is f(r2). We also extend this result to the dihedral group D(G).

    Communicated by T. H. Ha

    AMSC: 05A15, 20K01, 05C15, 20D60