图与边色图的循环自同构群

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-07-01 DOI:10.1016/j.endm.2018.06.008

Mariusz Grech, Andrzej Kisielewicz

{"title":"图与边色图的循环自同构群","authors":"Mariusz Grech, Andrzej Kisielewicz","doi":"10.1016/j.endm.2018.06.008","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we describe the automorphism groups of graphs and edge-colored graphs that are cyclic as permutation groups. In addition, we show that every such group is the automorphism group of a complete graph whose edges are colored with 3 colors, and we characterize those groups that are automorphism groups of simple graphs.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 41-46"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.008","citationCount":"4","resultStr":"{\"title\":\"Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs\",\"authors\":\"Mariusz Grech, Andrzej Kisielewicz\",\"doi\":\"10.1016/j.endm.2018.06.008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper we describe the automorphism groups of graphs and edge-colored graphs that are cyclic as permutation groups. In addition, we show that every such group is the automorphism group of a complete graph whose edges are colored with 3 colors, and we characterize those groups that are automorphism groups of simple graphs.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":\"68 \",\"pages\":\"Pages 41-46\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.008\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318300994\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318300994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 4

摘要

本文将循环的图和边色图的自同构群描述为置换群。此外，我们证明了每一个这样的群都是边被涂上3种颜色的完全图的自同构群，并刻画了这些群是简单图的自同构群。

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

查看原文本刊更多论文

Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs

In this paper we describe the automorphism groups of graphs and edge-colored graphs that are cyclic as permutation groups. In addition, we show that every such group is the automorphism group of a complete graph whose edges are colored with 3 colors, and we characterize those groups that are automorphism groups of simple graphs.

求助全文

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

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.