Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in

Options:
  Reset


Query: "author" (Orel Marko) .

1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
The core of a vertex-transitive complementary prism
Marko Orel, 2023, original scientific article

Abstract: The complementary prism $\Gamma \overline{\Gamma}$ is obtained from the union of a graph $\Gamma$ and its complement $\overline{\Gamma}$ where each pair of identical vertices in $\Gamma$ and $\overline{\Gamma}$ is joined by an edge. It generalizes the Petersen graph, which is the complementary prism of the pentagon. The core of a vertex-transitive complementary prism is studied. In particular, it is shown that a vertex-transitive complementary prism $\Gamma \overline{\Gamma}$ is a core, i.e. all its endomorphisms are automorphisms, whenever $\Gamma$ is a core or its core is a complete graph.
Keywords: graph homomorphism, complementary prism, self-complementary graph, vertex-transitive graph, core
Published in DiRROS: 09.04.2024; Views: 98; Downloads: 46
.pdf Full text (309,75 KB)
This document has many files! More...

2.
The core of a vertex transitive complementary prism of a lexicographic product
Marko Orel, 2023, original scientific article

Abstract: The complementary prism of a graph $\Gamma$ is the graph $\Gamma \overline{\Gamma}$, which is formed from the union of $\Gamma$ and its complement $\overline{\Gamma}$ by adding an edge between each pair of identical vertices in $\Gamma$ and $\overline{\Gamma}$. Vertex-transitive self-complementary graphs provide vertex-transitive complementary prisms. It was recently proved by the author that $\Gamma \overline{\Gamma}$ is a core, i.e. all its endomorphisms are automorphisms, whenever $\Gamma$ is vertex-transitive, self-complementary, and either $\Gamma$ 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 $\Gamma = \Gamma_1 [\Gamma_2]$. In the process some new results aboutthe homomorphisms of a lexicographic product are obtained.
Keywords: graph homomorphism, core, complementary prism, self-complementary graph, vertex-transitive graph, lexicographic product
Published in DiRROS: 19.03.2024; Views: 84; Downloads: 51
.pdf Full text (411,68 KB)
This document has many files! More...

Search done in 0.12 sec.
Back to top