- Tytuł:
- Convex and Weakly Convex Domination in Prism Graphs
- Autorzy:
- Rosicka, Monika
- Powiązania:
- https://bibliotekanauki.pl/articles/31343291.pdf
- Data publikacji:
- 2019-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
domination
prism graphs - Opis:
- For a given graph G = (V;E) and permutation π : V ↦ V the prism πG of G is defined as follows: V (πG) = V (G) ∪ V (G′), where G′ is a copy of G, and E(πG) = E(G) ∪ E(G′) ∪ Mπ, where Mπ = {uv′ : u ∈ V (G); v = π (u)} and v′ denotes the copy of v in G′. We study and compare the properties of convex and weakly convex dominating sets in prism graphs. In particular, we characterize prism γcon-fixers and -doublers. We also show that the differences γwcon(G) – γwcon(πG) and γwcon (πG) – 2γwcon (G) can be arbitrarily large, and that the convex domination number of πG cannot be bounded in terms of γcon (G).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 3; 741-755
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł