On the fixing number of graphs with abelian automorphism group

Authors

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

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.

Published

2011-09-09

How to Cite

Bradley J, Dankelmann P., Erwin D., & Rodrigues B.G. (2011). On the fixing number of graphs with abelian automorphism group. Utilitas Mathematica, 86. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/758

Issue

Vol. 86 (2011): Volume 86, 2011

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.