The Electronic Journal of Combinatorics · 2009 · 29 citations · 10 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsSet TheoryEnumerative CombinatoricsGraph LabelingGraph TheoryGroup TheoryEnumerative Graph TheoryFinite Abelian GroupsSet Cardinality
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 $\Gamma$ is the set of all fixing numbers of finite graphs with automorphism group $\Gamma$. 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.
10
Michael O. Albertson, Karen L. Collins · The Electronic Journal of Combinatorics · 1996 · 272 citations · Full text
Graphs of Degree Three with a Given Abstract Group
Robert Frucht · Canadian Journal of Mathematics · 1949 · 143 citations · Full text
Topics in graph automorphisms and reconstruction
Choice Reviews Online · 2004 · 115 citations
The Distinguishing Chromatic Number
Karen L. Collins, Ann N. Trenk · The Electronic Journal of Combinatorics · 2006 · 104 citations · Full text