Geodesic
Convex and Weakly Convex Domination in Prism Graphs
Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 3, pp. 741-755 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

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).
Keywords: domination, prism graphs 
@article{DMGT_2019_39_3_a9,
     author = {Rosicka, Monika},
     title = {Convex and {Weakly} {Convex} {Domination} in {Prism} {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {741--755},
     year = {2019},
     volume = {39},
     number = {3},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2019_39_3_a9/}
}
TY  - JOUR
AU  - Rosicka, Monika
TI  - Convex and Weakly Convex Domination in Prism Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2019
SP  - 741
EP  - 755
VL  - 39
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DMGT_2019_39_3_a9/
LA  - en
ID  - DMGT_2019_39_3_a9
ER  - 
%0 Journal Article
%A Rosicka, Monika
%T Convex and Weakly Convex Domination in Prism Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2019
%P 741-755
%V 39
%N 3
%U http://geodesic.mathdoc.fr/item/DMGT_2019_39_3_a9/
%G en
%F DMGT_2019_39_3_a9
Rosicka, Monika. Convex and Weakly Convex Domination in Prism Graphs. Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 3, pp. 741-755. http://geodesic.mathdoc.fr/item/DMGT_2019_39_3_a9/

[1] A.P. Burger, C.M. Mynhardt and W.D. Weakley, On the domination number of prisms of graphs, Discuss. Math. Graph Theory 2 (2004) 303–318. doi:10.7151/dmgt.1233

[2] G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincare 3 (1967) 433–438.

[3] M. Lemańska and R. Zuazua, Convex universal fixers, Discuss. Math. Graph Theory 32 (2012) 807–812. doi:10.7151/dmgt.1631

[4] C.M. Mynhardt and Z. Xu, Domination in prisms of graphs: universal fixers, Util. Math. 78 (2009) 185–201.

[5] M. Rosicka, A proof of the universal fixer conjecture, Util. Math., to appear.

[6] K. Wash, Edgeless graphs are the only universal fixers, Czechoslovak Math. J. 64 (2014) 833–843. doi:10.1007/s10587-014-0136-3