Distinguishing Polynomials of Graphs

Abstract

For a graph $G$, a $k$-coloring $c:V(G)\to \{1,2,\ldots, k\}$ is called distinguishing, if the only automorphism $f$ of $G$ with the property $c(v)=c(f(v))$ for every vertex $v\in G$ (color-preserving automorphism), is the identity. In this paper, we show that the number of distinguishing $k$-colorings of $G$ is a monic polynomial in $k$, calling it the distinguishing polynomial of $G$. Furthermore, we compute the distinguishing polynomials of cycles and complete multipartite graphs. We also show that the multiplicity of zero as a root of the distinguishing polynomial of $G$ is at least the number of orbits of $G$.

Figures (1)

• Figure 1: Reflections are relative to diagonals

Theorems & Definitions (27)

• proof
• Example 1.4
• Lemma 2.1
• Lemma 2.2
• proof
• Lemma 2.3
• proof
• Lemma 2.4
• proof
• Corollary 2.5