Mathematics – Combinatorics
Scientific paper
2011-03-31
Mathematics
Combinatorics
8 pages, 2 figures
Scientific paper
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.
Chbili Nafaa
No associations
LandOfFree
The Tutte polynomial and the automorphism group of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Tutte polynomial and the automorphism group of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Tutte polynomial and the automorphism group of a graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-245368