Symmetries of the Woolly Hat graphs

Leah Wrenn Berman, Hiroki Koike, Elías Mochán, Alejandra Ramos-Rivera, Primož Šparl, Stephen E. Wilson
{"title":"Symmetries of the Woolly Hat graphs","authors":"Leah Wrenn Berman, Hiroki Koike, Elías Mochán, Alejandra Ramos-Rivera, Primož Šparl, Stephen E. Wilson","doi":"10.26493/2590-9770.1617.83c","DOIUrl":null,"url":null,"abstract":"A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length. While the tetravalent edge-transitive graphs admitting a semiregular automorphism with only one orbit are easy to determine, those that admit a semiregular automorphism with two orbits took a considerable effort and were finally classified in 2012. Of the several possible different \"types\" of potential tetravalent edge-transitive graphs admitting a semiregular automorphism with three orbits, only one \"type\" has thus far received no attention. In this paper we focus on this class of graphs, which we call the Woolly Hat graphs. We prove that there are in fact no edge-transitive Woolly Hat graphs and classify the vertex-transitive ones.","PeriodicalId":382734,"journal":{"name":"The Art of Discrete and Applied Mathematics","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Art of Discrete and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/2590-9770.1617.83c","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length. While the tetravalent edge-transitive graphs admitting a semiregular automorphism with only one orbit are easy to determine, those that admit a semiregular automorphism with two orbits took a considerable effort and were finally classified in 2012. Of the several possible different "types" of potential tetravalent edge-transitive graphs admitting a semiregular automorphism with three orbits, only one "type" has thus far received no attention. In this paper we focus on this class of graphs, which we call the Woolly Hat graphs. We prove that there are in fact no edge-transitive Woolly Hat graphs and classify the vertex-transitive ones.
羊毛帽图的对称性
如果图的自同构群在其边集上的自然作用是可传递的,则图是边可传递的。如果图的自同构所生成的子群的轨道长度相同,则图的自同构是半正则的。承认只有一个轨道的半正则自同构的四价边传递图很容易确定,而承认具有两个轨道的半正则自同构的四价边传递图则花费了相当大的努力,最终在2012年被分类。在承认具有三个轨道的半正则自同构的势四价边传递图的几种可能的不同“类型”中,迄今为止只有一种“类型”没有得到注意。本文主要研究这类图,我们称之为Woolly Hat图。证明了实际上不存在边传递的Woolly Hat图,并对顶点传递的Woolly Hat图进行了分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书