{"title":"完全图的对称覆盖和伪覆盖","authors":"Yan Zhou Zhu","doi":"10.1016/j.disc.2025.114677","DOIUrl":null,"url":null,"abstract":"<div><div>We first characterize all faithful arc-transitive covers of complete graphs and we give a general construction of such covers.</div><div>A graph Γ is a pseudocover of its quotient Σ if they have the same valency and Γ is not a cover of Σ. As the second result of this paper, we prove that the complete graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> has a connected arc-transitive pseudocover if and only if <span><math><mi>n</mi><mo>−</mo><mn>1</mn></math></span> is not a prime.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"349 1","pages":"Article 114677"},"PeriodicalIF":0.7000,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symmetric covers and pseudocovers of complete graphs\",\"authors\":\"Yan Zhou Zhu\",\"doi\":\"10.1016/j.disc.2025.114677\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We first characterize all faithful arc-transitive covers of complete graphs and we give a general construction of such covers.</div><div>A graph Γ is a pseudocover of its quotient Σ if they have the same valency and Γ is not a cover of Σ. As the second result of this paper, we prove that the complete graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> has a connected arc-transitive pseudocover if and only if <span><math><mi>n</mi><mo>−</mo><mn>1</mn></math></span> is not a prime.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"349 1\",\"pages\":\"Article 114677\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X25002857\",\"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":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25002857","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Symmetric covers and pseudocovers of complete graphs
We first characterize all faithful arc-transitive covers of complete graphs and we give a general construction of such covers.
A graph Γ is a pseudocover of its quotient Σ if they have the same valency and Γ is not a cover of Σ. As the second result of this paper, we prove that the complete graph has a connected arc-transitive pseudocover if and only if is not a prime.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.