{"title":"Fixing Numbers of Graphs with Symmetric and Generalized Quaternion Symmetry Groups","authors":"Christina Graves, L.-K. Lauderdale","doi":"10.1007/s00373-023-02742-9","DOIUrl":null,"url":null,"abstract":"<p>The <i>fixing number</i> of a graph <span>\\(\\Gamma \\)</span> is the minimum number of vertices that, when fixed, remove all nontrivial automorphisms from the automorphism group of <span>\\(\\Gamma \\)</span>. This concept was extended to finite groups by Gibbons and Laison. The <i>fixing set</i> of a finite group <i>G</i> is the set of all fixing numbers of graphs whose automorphism groups are isomorphic to <i>G</i>. Surprisingly few fixing sets of groups have been established; only the fixing sets of abelian groups and dihedral groups are completely understood. However, the fixing sets of symmetric groups have been studied previously. In this article, we establish new elements of the fixing sets of symmetric groups by considering line graphs of complete graphs. We conclude by establishing the fixing sets of generalized quaternion groups.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-023-02742-9","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The fixing number of a graph \(\Gamma \) is the minimum number of vertices that, when fixed, remove all nontrivial automorphisms from the automorphism group of \(\Gamma \). This concept was extended to finite groups by Gibbons and Laison. The fixing set of a finite group G is the set of all fixing numbers of graphs whose automorphism groups are isomorphic to G. Surprisingly few fixing sets of groups have been established; only the fixing sets of abelian groups and dihedral groups are completely understood. However, the fixing sets of symmetric groups have been studied previously. In this article, we establish new elements of the fixing sets of symmetric groups by considering line graphs of complete graphs. We conclude by establishing the fixing sets of generalized quaternion groups.
期刊介绍:
Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.