奇素价边传递图的半正则自同构的存在性

IF 1.2 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A Pub Date : 2025-09-18 DOI:10.1016/j.jcta.2025.106117

Wenjuan Luo, Jing Xu

{"title":"奇素价边传递图的半正则自同构的存在性","authors":"Wenjuan Luo, Jing Xu","doi":"10.1016/j.jcta.2025.106117","DOIUrl":null,"url":null,"abstract":"<div><div>The Polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism whose cycles all have the same length. Similarly, in <span><span>[11]</span></span> the authors asked if every connected regular edge-transitive graph admits a semiregular automorphism. In this paper we prove that edge-transitive graphs of odd prime valency have a semiregular automorphism.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"218 ","pages":"Article 106117"},"PeriodicalIF":1.2000,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Existences of semiregular automorphisms of edge-transitive graphs of odd prime valency\",\"authors\":\"Wenjuan Luo, Jing Xu\",\"doi\":\"10.1016/j.jcta.2025.106117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The Polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism whose cycles all have the same length. Similarly, in <span><span>[11]</span></span> the authors asked if every connected regular edge-transitive graph admits a semiregular automorphism. In this paper we prove that edge-transitive graphs of odd prime valency have a semiregular automorphism.</div></div>\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":\"218 \",\"pages\":\"Article 106117\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series A\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0097316525001128\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316525001128","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

多循环猜想断言每个顶点传递有向图都有一个环长度相同的半正则自同构。类似地，在[11]中，作者问是否每个连通正则边传递图都承认一个半正则自同构。证明了奇素价边传递图具有半正则自同构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Existences of semiregular automorphisms of edge-transitive graphs of odd prime valency

The Polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism whose cycles all have the same length. Similarly, in [11] the authors asked if every connected regular edge-transitive graph admits a semiregular automorphism. In this paper we prove that edge-transitive graphs of odd prime valency have a semiregular automorphism.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory Series A 数学-数学

CiteScore

2.90

自引率

9.10%

发文量

审稿时长

12 months

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.