{"title":"The core of a vertex transitive complementary prism of a lexicographic product","authors":"Marko Orel","doi":"10.26493/2590-9770.1623.7f0","DOIUrl":null,"url":null,"abstract":"The complementary prism of a graph Γ is the graph ΓΓ̄, which is formed from the union of Γ and its complement Γ̄ by adding an edge between each pair of identical vertices in Γ and Γ̄. Vertex-transitive self-complementary graphs provide vertex-transitive complementary prisms. It was recently proved by the author that ΓΓ̄ is a core, i.e. all its endomorphisms are automorphisms, whenever Γ is vertex-transitive, self-complementary, and either Γ is a core or its core is a complete graph. In this paper the same conclusion is obtained for some other classes of vertex-transitive self-complementary graphs that can be decomposed as a lexicographic product Γ = Γ1[Γ2]. In the process some new results about the homomorphisms of a lexicographic product are obtained.","PeriodicalId":382734,"journal":{"name":"The Art of Discrete and Applied Mathematics","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Art of Discrete and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/2590-9770.1623.7f0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The complementary prism of a graph Γ is the graph ΓΓ̄, which is formed from the union of Γ and its complement Γ̄ by adding an edge between each pair of identical vertices in Γ and Γ̄. Vertex-transitive self-complementary graphs provide vertex-transitive complementary prisms. It was recently proved by the author that ΓΓ̄ is a core, i.e. all its endomorphisms are automorphisms, whenever Γ is vertex-transitive, self-complementary, and either Γ is a core or its core is a complete graph. In this paper the same conclusion is obtained for some other classes of vertex-transitive self-complementary graphs that can be decomposed as a lexicographic product Γ = Γ1[Γ2]. In the process some new results about the homomorphisms of a lexicographic product are obtained.