Saved in:
Bibliographic Details
Main Authors: Gibbons, Courtney R., Laison, Joshua D.
Format: Preprint
Published: 2018
Subjects:
Online Access:https://arxiv.org/abs/1807.04372
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910645595668480
author Gibbons, Courtney R.
Laison, Joshua D.
author_facet Gibbons, Courtney R.
Laison, Joshua D.
contents The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $Γ$ is the set of all fixing numbers of finite graphs with automorphism group $Γ$. Several authors have studied the distinguishing number of a graph, the smallest number of labels needed to label $G$ so that the automorphism group of the labeled graph is trivial. The fixing number can be thought of as a variation of the distinguishing number in which every label may be used only once, and not every vertex need be labeled. We characterize the fixing sets of finite abelian groups, and investigate the fixing sets of symmetric groups.
format Preprint
id arxiv_https___arxiv_org_abs_1807_04372
institution arXiv
publishDate 2018
record_format arxiv
spellingShingle Fixing Numbers of Graphs and Groups
Gibbons, Courtney R.
Laison, Joshua D.
Combinatorics
05C25
The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $Γ$ is the set of all fixing numbers of finite graphs with automorphism group $Γ$. Several authors have studied the distinguishing number of a graph, the smallest number of labels needed to label $G$ so that the automorphism group of the labeled graph is trivial. The fixing number can be thought of as a variation of the distinguishing number in which every label may be used only once, and not every vertex need be labeled. We characterize the fixing sets of finite abelian groups, and investigate the fixing sets of symmetric groups.
title Fixing Numbers of Graphs and Groups
topic Combinatorics
05C25
url https://arxiv.org/abs/1807.04372