{"title":"两倍无平方阶的边跨立方图","authors":"Gui Xian Liu, Zai Ping Lu","doi":"10.1002/jgt.23168","DOIUrl":null,"url":null,"abstract":"A graph is edge‐transitive if its automorphism group acts transitively on the edge set. This paper presents a complete classification for connected edge‐transitive cubic graphs of order , where is even and square‐free. In particular, it is shown that such a graph is either symmetric or isomorphic to one of the following graphs: a semisymmetric graph of order 420, a semisymmetric graph of order 29,260, and five families of semisymmetric graphs constructed from the simple group .","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Edge‐transitive cubic graphs of twice square‐free order\",\"authors\":\"Gui Xian Liu, Zai Ping Lu\",\"doi\":\"10.1002/jgt.23168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph is edge‐transitive if its automorphism group acts transitively on the edge set. This paper presents a complete classification for connected edge‐transitive cubic graphs of order , where is even and square‐free. In particular, it is shown that such a graph is either symmetric or isomorphic to one of the following graphs: a semisymmetric graph of order 420, a semisymmetric graph of order 29,260, and five families of semisymmetric graphs constructed from the simple group .\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/jgt.23168\",\"RegionNum\":3,\"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 Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/jgt.23168","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Edge‐transitive cubic graphs of twice square‐free order
A graph is edge‐transitive if its automorphism group acts transitively on the edge set. This paper presents a complete classification for connected edge‐transitive cubic graphs of order , where is even and square‐free. In particular, it is shown that such a graph is either symmetric or isomorphic to one of the following graphs: a semisymmetric graph of order 420, a semisymmetric graph of order 29,260, and five families of semisymmetric graphs constructed from the simple group .
期刊介绍：
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
