Geodesic
Double domination critical and stable graphs upon vertex removal
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 4, pp. 643-657.

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

In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a graph G is a subset of vertices that dominates every vertex of G at least twice. The double domination number of G, denoted γ_×2(G), is the minimum cardinality among all double dominating sets of G. We consider the effects of vertex removal on the double domination number of a graph. A graph G is γ_×2-vertex critical graph (γ_×2-vertex stable graph, respectively) if the removal of any vertex different from a support vertex decreases (does not change, respectively) γ_×2(G). In this paper we investigate various properties of these graphs. Moreover, we characterize γ_×2-vertex critical trees and γ_×2-vertex stable trees.
Keywords: double domination, vertex removal critical graphs, vertex removal stable graphs 
@article{DMGT_2012_32_4_a3,
     author = {Khelifi, Soufiane and Chellali, Mustapha},
     title = {Double domination critical and stable graphs upon vertex removal},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {643--657},
     publisher = {mathdoc},
     volume = {32},
     number = {4},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a3/}
}
TY  - JOUR
AU  - Khelifi, Soufiane
AU  - Chellali, Mustapha
TI  - Double domination critical and stable graphs upon vertex removal
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 643
EP  - 657
VL  - 32
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a3/
LA  - en
ID  - DMGT_2012_32_4_a3
ER  - 
%0 Journal Article
%A Khelifi, Soufiane
%A Chellali, Mustapha
%T Double domination critical and stable graphs upon vertex removal
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 643-657
%V 32
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a3/
%G en
%F DMGT_2012_32_4_a3
Khelifi, Soufiane; Chellali, Mustapha. Double domination critical and stable graphs upon vertex removal. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 4, pp. 643-657. http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a3/

[1] M. Blidia, M. Chellali, T.W. Haynes and M. Henning, Independent and double domination in trees, Util. Math. 70 (2006) 159-173.

[2] M. Blidia, M. Chellali and S. Khelifi, Vertices belonging to all or to no minimum double domination sets of trees, AKCE Int. J. Graphs Comb. 2(1) (2005) 1-9.

[3] G. Chartrand and L. Lesniak, Graphs and Digraphs: Fourth edition (Chapman and Hall/CRC Inc., Boca Raton, Fl., 2005).

[4] M. Chellali and T.W. Haynes, Double domination stable graphs upon edge removal, Australas. J. Combin. 47 (2010) 157-164.

[5] F. Harary and T.W. Haynes, Double domination in graphs, Ars Combin. 55 (2000) 201-213.

[6] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc., New York, 1998).

[7] S. Khelifi, M. Blidia, M. Chellali and F. Maffray, Double domination edge removal critical graphs, Australas. J. Combin. 48 (2010) 285-299.