The Tutte polynomial and the automorphism group of a graph
Combinatorics
2011-04-01 v1 Geometric Topology
Abstract
A graph is said to be -periodic, if the automorphism group contains an element of order 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 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.
Keywords
Cite
@article{arxiv.1103.6134,
title = {The Tutte polynomial and the automorphism group of a graph},
author = {Nafaa Chbili},
journal= {arXiv preprint arXiv:1103.6134},
year = {2011}
}
Comments
8 pages, 2 figures