Geodesic
Paired- and induced paired-domination in {E,net}-free graphs
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 3, pp. 473-485

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

A dominating set of a graph is a vertex subset that any vertex belongs to or is adjacent to. Among the many well-studied variants of domination are the so-called paired-dominating sets. A paired-dominating set is a dominating set whose induced subgraph has a perfect matching. In this paper, we continue their study.
Keywords: domination, paired-domination, induced paired-domination, induced matchings, {E,net}-free graphs 
@article{DMGT_2012_32_3_a7,
     author = {Schaudt, Oliver},
     title = {Paired- and induced paired-domination in {{E,net}-free} graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {473--485},
     publisher = {mathdoc},
     volume = {32},
     number = {3},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_3_a7/}
}
TY  - JOUR
AU  - Schaudt, Oliver
TI  - Paired- and induced paired-domination in {E,net}-free graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 473
EP  - 485
VL  - 32
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_3_a7/
LA  - en
ID  - DMGT_2012_32_3_a7
ER  - 
%0 Journal Article
%A Schaudt, Oliver
%T Paired- and induced paired-domination in {E,net}-free graphs
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 473-485
%V 32
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_3_a7/
%G en
%F DMGT_2012_32_3_a7
Schaudt, Oliver. Paired- and induced paired-domination in {E,net}-free graphs. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 3, pp. 473-485. http://geodesic.mathdoc.fr/item/DMGT_2012_32_3_a7/