Graph polynomials and symmetries
Combinatorics
2018-02-26 v1
Abstract
In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of this paper is to extend this study to other graph polynomials. In particular, we prove that if a graph has a symmetry of prime order , then its characteristic polynomial, with coefficients in the finite filed , is determined by the characteristic polynomial of its quotient graph . Similar results are also proved for some generalization of the Tutte polynomial.
Cite
@article{arxiv.1802.08487,
title = {Graph polynomials and symmetries},
author = {Chbili Nafaa},
journal= {arXiv preprint arXiv:1802.08487},
year = {2018}
}