{"title":"关于六价半弧透二面体","authors":"Mi-Mi Zhang","doi":"10.1016/j.disc.2024.114180","DOIUrl":null,"url":null,"abstract":"<div><p>A graph is <em>half-arc-transitive</em> if its full automorphism group acts transitively on its vertex set and edge set, but not arc set. A half-arc-transitive graph is <em>half-arc-regular</em> if its full automorphism group acts regularly on its edges. A graph is said to be a <em>bi-Cayley graph</em> over a group <em>H</em> if it admits <em>H</em> as a semiregular automorphism group with two vertex-orbits. A bi-Cayley graph over a dihedral group is called <em>bi-dihedrant</em>. In this paper, it is shown that the smallest valency of half-arc-transitive bi-dihendrants is 6, and then a classification is given of connected half-arc-regular bi-dihedrants of valency 6. This work together with the result in <span><span>[8, Theorem 6.7]</span></span> completes the classification of edge-regular bi-dihedrants of valency 6.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On hexavalent half-arc-transitive bi-dihedrants\",\"authors\":\"Mi-Mi Zhang\",\"doi\":\"10.1016/j.disc.2024.114180\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A graph is <em>half-arc-transitive</em> if its full automorphism group acts transitively on its vertex set and edge set, but not arc set. A half-arc-transitive graph is <em>half-arc-regular</em> if its full automorphism group acts regularly on its edges. A graph is said to be a <em>bi-Cayley graph</em> over a group <em>H</em> if it admits <em>H</em> as a semiregular automorphism group with two vertex-orbits. A bi-Cayley graph over a dihedral group is called <em>bi-dihedrant</em>. In this paper, it is shown that the smallest valency of half-arc-transitive bi-dihendrants is 6, and then a classification is given of connected half-arc-regular bi-dihedrants of valency 6. This work together with the result in <span><span>[8, Theorem 6.7]</span></span> completes the classification of edge-regular bi-dihedrants of valency 6.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X2400311X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X2400311X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A graph is half-arc-transitive if its full automorphism group acts transitively on its vertex set and edge set, but not arc set. A half-arc-transitive graph is half-arc-regular if its full automorphism group acts regularly on its edges. A graph is said to be a bi-Cayley graph over a group H if it admits H as a semiregular automorphism group with two vertex-orbits. A bi-Cayley graph over a dihedral group is called bi-dihedrant. In this paper, it is shown that the smallest valency of half-arc-transitive bi-dihendrants is 6, and then a classification is given of connected half-arc-regular bi-dihedrants of valency 6. This work together with the result in [8, Theorem 6.7] completes the classification of edge-regular bi-dihedrants of valency 6.