{"title":"小运动顶点传递图与小最小度传递置换群","authors":"Antonio Montero , Primož Potočnik","doi":"10.1016/j.jcta.2025.106065","DOIUrl":null,"url":null,"abstract":"<div><div>The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper, we develop some results on permutation groups (primitive and imprimitive) with small minimal degree. As a consequence of such results, we classify vertex-transitive graphs whose motion is 4 or a prime number.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"216 ","pages":"Article 106065"},"PeriodicalIF":1.2000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Vertex-transitive graphs with small motion and transitive permutation groups with small minimal degree\",\"authors\":\"Antonio Montero , Primož Potočnik\",\"doi\":\"10.1016/j.jcta.2025.106065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper, we develop some results on permutation groups (primitive and imprimitive) with small minimal degree. As a consequence of such results, we classify vertex-transitive graphs whose motion is 4 or a prime number.</div></div>\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":\"216 \",\"pages\":\"Article 106065\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-05-22\",\"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/S0097316525000603\",\"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/S0097316525000603","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Vertex-transitive graphs with small motion and transitive permutation groups with small minimal degree
The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper, we develop some results on permutation groups (primitive and imprimitive) with small minimal degree. As a consequence of such results, we classify vertex-transitive graphs whose motion is 4 or a prime number.
期刊介绍:
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.