The Orbital Chromatic Polynomial of a Cycle

MaRDI QIDQ6349309zbMATH OpenFDO

Authors Klaus Dohmen

Publication date 17 September 2020

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31) Group actions on combinatorial structures (05E18) Congruences; primitive roots; residue systems (11A07) General theory for finite permutation groups (20B05)

Abstract: The orbital chromatic polynomial introduced by Cameron and Kayibi counts the number of proper $lambda$-colorings of a graph modulo a group of symmetries. In this paper, we establish expansions for the orbital chromatic polynomial of the $n$-cycle for the group of rotations and its full automorphism group. Besides, we obtain a new proof of Fermat's Little Theorem.

This page was built for publication: The Orbital Chromatic Polynomial of a Cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6349309)