Geodesic
Paired domination in prisms of graphs
Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 1, pp. 5-23

Voir la notice de l'article provenant de la source Library of Science

The paired domination number γ_pr(G) of a graph G is the smallest cardinality of a dominating set S of G such that 〈S〉 has a perfect matching. The generalized prisms πG of G are the graphs obtained by joining the vertices of two disjoint copies of G by |V(G)| independent edges. We provide characterizations of the following three classes of graphs: γ_pr(πG) = 2γ_pr(G) for all πG; γ_pr(K₂☐ G) = 2γ_pr(G); γ_pr(K₂☐ G) = γ_pr(G).
Keywords: domination, paired domination, prism of a graph, Cartesian product 
@article{DMGT_2011_31_1_a0,
     author = {Mynhardt, Christina and Schurch, Mark},
     title = {Paired domination in prisms of graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {5--23},
     publisher = {mathdoc},
     volume = {31},
     number = {1},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2011_31_1_a0/}
}
TY  - JOUR
AU  - Mynhardt, Christina
AU  - Schurch, Mark
TI  - Paired domination in prisms of graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2011
SP  - 5
EP  - 23
VL  - 31
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2011_31_1_a0/
LA  - en
ID  - DMGT_2011_31_1_a0
ER  - 
%0 Journal Article
%A Mynhardt, Christina
%A Schurch, Mark
%T Paired domination in prisms of graphs
%J Discussiones Mathematicae. Graph Theory
%D 2011
%P 5-23
%V 31
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2011_31_1_a0/
%G en
%F DMGT_2011_31_1_a0
Mynhardt, Christina; Schurch, Mark. Paired domination in prisms of graphs. Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 1, pp. 5-23. http://geodesic.mathdoc.fr/item/DMGT_2011_31_1_a0/