{"title":"有限置换群的索引图","authors":"H. M. Mohammed Salih","doi":"10.19184/ijc.2022.6.2.2","DOIUrl":null,"url":null,"abstract":"Let <em>G</em> be a subgroup of <em>S</em><sub>n</sub>. For <em>x ∈ G</em>, the index of <em>x</em> in <em>G</em> is denoted by <em>ind x</em> is the minimal number of 2-cycles needed to express <em>x</em> as a product. In this paper, we define a new kind of graph on <em>G</em>, namely the index graph and denoted by <em>Γ</em><sup>ind</sup><em>(G)</em>. Its vertex set the set of all conjugacy classes of <em>G</em> and two distinct vertices <em>x ∈ C</em><sub>x</sub> and <em>y ∈ C</em><sub>y</sub> are adjacent if <em>Gcd(ind x, ind y) 6 ≠ 1</em>. We study some properties of this graph for the symmetric groups <em>S</em><sub>n</sub>, the alternating group <em>A</em><sub>n</sub>, the cyclic group <em>C</em><sub>n</sub>, the dihedral group <em>D</em><sub>2n</sub> and the generalized quaternain group <em>Q</em><sub>4n</sub>. In particular, we are interested in the connectedness of them.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"2016 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Index graphs of finite permutation groups\",\"authors\":\"H. M. Mohammed Salih\",\"doi\":\"10.19184/ijc.2022.6.2.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let <em>G</em> be a subgroup of <em>S</em><sub>n</sub>. For <em>x ∈ G</em>, the index of <em>x</em> in <em>G</em> is denoted by <em>ind x</em> is the minimal number of 2-cycles needed to express <em>x</em> as a product. In this paper, we define a new kind of graph on <em>G</em>, namely the index graph and denoted by <em>Γ</em><sup>ind</sup><em>(G)</em>. Its vertex set the set of all conjugacy classes of <em>G</em> and two distinct vertices <em>x ∈ C</em><sub>x</sub> and <em>y ∈ C</em><sub>y</sub> are adjacent if <em>Gcd(ind x, ind y) 6 ≠ 1</em>. We study some properties of this graph for the symmetric groups <em>S</em><sub>n</sub>, the alternating group <em>A</em><sub>n</sub>, the cyclic group <em>C</em><sub>n</sub>, the dihedral group <em>D</em><sub>2n</sub> and the generalized quaternain group <em>Q</em><sub>4n</sub>. In particular, we are interested in the connectedness of them.\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"2016 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/ijc.2022.6.2.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/ijc.2022.6.2.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let G be a subgroup of Sn. For x ∈ G, the index of x in G is denoted by ind x is the minimal number of 2-cycles needed to express x as a product. In this paper, we define a new kind of graph on G, namely the index graph and denoted by Γind(G). Its vertex set the set of all conjugacy classes of G and two distinct vertices x ∈ Cx and y ∈ Cy are adjacent if Gcd(ind x, ind y) 6 ≠ 1. We study some properties of this graph for the symmetric groups Sn, the alternating group An, the cyclic group Cn, the dihedral group D2n and the generalized quaternain group Q4n. In particular, we are interested in the connectedness of them.