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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.