两倍无平方阶的边跨立方图

Pub Date : 2024-09-17 DOI:10.1002/jgt.23168

Gui Xian Liu, Zai Ping Lu

{"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":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"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\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/jgt.23168\",\"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://doi.org/10.1002/jgt.23168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果一个图的自变群在边集上作传递作用，那么这个图就是边传递图。本文介绍了阶为，其中阶为偶数且无平方的连边立方图的完整分类。本文特别指出，这样的图要么是对称的，要么与下列图同构：阶为 420 的半对称图、阶为 29 260 的半对称图，以及由简单群构造的五个半对称图族。

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

查看原文

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 .

求助全文

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