Distinguishing Polynomials of Graphs

Mohammad Hassan Shirdareh Haghighi, Amir Mohammad Ghazanfari, Seyed Ali Reza Talebpour Shirazi Fard

For a graph $G$, a $k$-coloring $c:V(G)\to \{1,2,\dots ,k\}$ is called distinguishing, if the only automorphism $f$ of $G$ with the property $c(v)=c(f(v))$ for every vertex $v\in…