On the fixing number of graphs with abelian automorphism group

J. Bradley; P. Dankelmann; D. Erwin; B. G. Rodrigues

On the fixing number of graphs with abelian automorphism group

J. Bradley, P. Dankelmann, D. Erwin, B. G. Rodrigues

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

2 Citations (Scopus)

Abstract

The fixing number of a graph G is the cardinality of a smallest set of vertices of G that is not fixed by any non-trivial automorphism of G. In this paper we investigate the fixing number of finite graphs with abelian automorphism group.

Original language	English
Pages (from-to)	71-78
Number of pages	8
Journal	Utilitas Mathematica
Volume	86
Publication status	Published - Nov 2011
Externally published	Yes

ASJC Scopus subject areas

Statistics and Probability
Statistics, Probability and Uncertainty
Applied Mathematics

Cite this

@article{65f1109ed4f34e158e043e87929ccd23,

title = "On the fixing number of graphs with abelian automorphism group",

abstract = "The fixing number of a graph G is the cardinality of a smallest set of vertices of G that is not fixed by any non-trivial automorphism of G. In this paper we investigate the fixing number of finite graphs with abelian automorphism group.",

author = "J. Bradley and P. Dankelmann and D. Erwin and Rodrigues, {B. G.}",

year = "2011",

month = nov,

language = "English",

volume = "86",

pages = "71--78",

journal = "Utilitas Mathematica",

issn = "0315-3681",

publisher = "Utilitas Mathematica Publishing Inc.",

}

TY - JOUR

T1 - On the fixing number of graphs with abelian automorphism group

AU - Bradley, J.

AU - Dankelmann, P.

AU - Erwin, D.

AU - Rodrigues, B. G.

PY - 2011/11

Y1 - 2011/11

N2 - The fixing number of a graph G is the cardinality of a smallest set of vertices of G that is not fixed by any non-trivial automorphism of G. In this paper we investigate the fixing number of finite graphs with abelian automorphism group.

AB - The fixing number of a graph G is the cardinality of a smallest set of vertices of G that is not fixed by any non-trivial automorphism of G. In this paper we investigate the fixing number of finite graphs with abelian automorphism group.

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

M3 - Article

AN - SCOPUS:81355124865

SN - 0315-3681

VL - 86

SP - 71

EP - 78

JO - Utilitas Mathematica

JF - Utilitas Mathematica

ER -

On the fixing number of graphs with abelian automorphism group

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this