arXiv:1103.6134 [math.CO]AbstractReferencesReviewsResources
The Tutte polynomial and the automorphism group of a graph
Published 2011-03-31Version 1
A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph periodicity. In particular, we prove that if $p$ is a prime, then the coefficients of the Tutte polynomial of such a graph satisfy a certain necessary condition. This result is illustrated by an example where the Tutte polynomial is used to rule out the periodicity of the Frucht graph.
Comments: 8 pages, 2 figures
Related articles: Most relevant | Search more
arXiv:1802.08487 [math.CO] (Published 2018-02-23)
Graph polynomials and symmetries
arXiv:1210.2540 [math.CO] (Published 2012-10-09)
On the Automorphism Group of a Binary Self-dual [120, 60, 24] Code
Automorphism groups of root systems matroids