A note on the tutte polynomial and the automorphism group of a graph

Nafaa Chbili; S. Klavzar

doi:10.1142/S1793557114500016

A note on the tutte polynomial and the automorphism group of a graph

Nafaa Chbili, S. Klavzar

Department of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

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 short note, we investigate the behavior of graph polynomials (Negami 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.

Original language	English
Article number	1450001
Journal	Asian-European Journal of Mathematics
Volume	7
Issue number	1
DOIs	https://doi.org/10.1142/S1793557114500016
Publication status	Published - Mar 2014

Keywords

Automorphism group
Graph periodicity
Tutte and Negami polynomials

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1142/S1793557114500016

Cite this

@article{5b3c939fdf6848a794682605dad6b0ca,

title = "A note on the tutte polynomial and the automorphism group of a graph",

abstract = "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 short note, we investigate the behavior of graph polynomials (Negami 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.",

keywords = "Automorphism group, Graph periodicity, Tutte and Negami polynomials",

author = "Nafaa Chbili and S. Klavzar",

note = "Funding Information: The author would like to express his sincere appreciation to the Research Affairs at the United Arab Emirates University for the financial support of this project under fund grant ♯1546-02-01-10.",

year = "2014",

month = mar,

doi = "10.1142/S1793557114500016",

language = "English",

volume = "7",

journal = "Asian-European Journal of Mathematics",

issn = "1793-5571",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "1",

}

TY - JOUR

T1 - A note on the tutte polynomial and the automorphism group of a graph

AU - Chbili, Nafaa

AU - Klavzar, S.

N1 - Funding Information: The author would like to express his sincere appreciation to the Research Affairs at the United Arab Emirates University for the financial support of this project under fund grant ♯1546-02-01-10.

PY - 2014/3

Y1 - 2014/3

N2 - 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 short note, we investigate the behavior of graph polynomials (Negami 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.

AB - 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 short note, we investigate the behavior of graph polynomials (Negami 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.

KW - Automorphism group

KW - Graph periodicity

KW - Tutte and Negami polynomials

UR - http://www.scopus.com/inward/record.url?scp=84897113404&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897113404&partnerID=8YFLogxK

U2 - 10.1142/S1793557114500016

DO - 10.1142/S1793557114500016

M3 - Article

AN - SCOPUS:84897113404

SN - 1793-5571

VL - 7

JO - Asian-European Journal of Mathematics

JF - Asian-European Journal of Mathematics

IS - 1

M1 - 1450001

ER -

A note on the tutte polynomial and the automorphism group of a graph

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this