{"title":"Using mixed dihedral groups to construct normal Cayley graphs and a new bipartite 2-arc-transitive graph which is not a Cayley graph","authors":"Daniel R. Hawtin, Cheryl E. Praeger, Jin-Xin Zhou","doi":"10.1007/s10801-024-01300-7","DOIUrl":null,"url":null,"abstract":"<p>A <i>mixed dihedral group</i> is a group <i>H</i> with two disjoint subgroups <i>X</i> and <i>Y</i>, each elementary abelian of order <span>\\(2^n\\)</span>, such that <i>H</i> is generated by <span>\\(X\\cup Y\\)</span>, and <span>\\(H/H'\\cong X\\times Y\\)</span>. In this paper, we give a sufficient condition such that the automorphism group of the Cayley graph <span>\\(\\textrm{Cay}(H,(X\\cup Y){\\setminus }\\{1\\})\\)</span> is equal to <span>\\(H\\rtimes A(H,X,Y)\\)</span>, where <i>A</i>(<i>H</i>, <i>X</i>, <i>Y</i>) is the setwise stabiliser in <span>\\({{\\,\\textrm{Aut}\\,}}(H)\\)</span> of <span>\\(X\\cup Y\\)</span>. We use this criterion to resolve a question of Li et al. (J Aust Math Soc 86:111-122, 2009), by constructing a 2-arc-transitive normal cover of order <span>\\(2^{53}\\)</span> of the complete bipartite graph <span>\\({{\\textbf {K}}}_{16,16}\\)</span> and prove that it is <i>not</i> a Cayley graph.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10801-024-01300-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A mixed dihedral group is a group H with two disjoint subgroups X and Y, each elementary abelian of order \(2^n\), such that H is generated by \(X\cup Y\), and \(H/H'\cong X\times Y\). In this paper, we give a sufficient condition such that the automorphism group of the Cayley graph \(\textrm{Cay}(H,(X\cup Y){\setminus }\{1\})\) is equal to \(H\rtimes A(H,X,Y)\), where A(H, X, Y) is the setwise stabiliser in \({{\,\textrm{Aut}\,}}(H)\) of \(X\cup Y\). We use this criterion to resolve a question of Li et al. (J Aust Math Soc 86:111-122, 2009), by constructing a 2-arc-transitive normal cover of order \(2^{53}\) of the complete bipartite graph \({{\textbf {K}}}_{16,16}\) and prove that it is not a Cayley graph.