{"title":"关于K(n, 4)的自同态单群","authors":"Hailong Hou, Rui Gu","doi":"10.1142/S1005386712000302","DOIUrl":null,"url":null,"abstract":"In this paper, the endomorphism monoid of circulant complete graph K(n,3) is explored explicitly. It is shown that AutK(n,3)) =Dn, the dihedral group of degree n. It is also shown that K(n,3) is unretractive when 3 does not divide n, End(K(3m,3)) =qEnd(K(3m,3)), sEnd(K(3m,3)) =Aut(K(3m,3)) and K(3m,3) is endomorphism-regular. The structure of End(K(3m,3)) is characterized and some enumerative problems concerning End(K(n,3)) are solved.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On the endomorphism monoid of K(n, 4)\",\"authors\":\"Hailong Hou, Rui Gu\",\"doi\":\"10.1142/S1005386712000302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the endomorphism monoid of circulant complete graph K(n,3) is explored explicitly. It is shown that AutK(n,3)) =Dn, the dihedral group of degree n. It is also shown that K(n,3) is unretractive when 3 does not divide n, End(K(3m,3)) =qEnd(K(3m,3)), sEnd(K(3m,3)) =Aut(K(3m,3)) and K(3m,3) is endomorphism-regular. The structure of End(K(3m,3)) is characterized and some enumerative problems concerning End(K(n,3)) are solved.\",\"PeriodicalId\":378960,\"journal\":{\"name\":\"Ars Comb.\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Comb.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S1005386712000302\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Comb.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S1005386712000302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, the endomorphism monoid of circulant complete graph K(n,3) is explored explicitly. It is shown that AutK(n,3)) =Dn, the dihedral group of degree n. It is also shown that K(n,3) is unretractive when 3 does not divide n, End(K(3m,3)) =qEnd(K(3m,3)), sEnd(K(3m,3)) =Aut(K(3m,3)) and K(3m,3) is endomorphism-regular. The structure of End(K(3m,3)) is characterized and some enumerative problems concerning End(K(n,3)) are solved.