Geodesic
Full domination in graphs
Discussiones Mathematicae. Graph Theory, Tome 21 (2001) no. 1, pp. 43-62 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

For each vertex v in a graph G, let there be associated a subgraph H_v of G. The vertex v is said to dominate H_v as well as dominate each vertex and edge of H_v. A set S of vertices of G is called a full dominating set if every vertex of G is dominated by some vertex of S, as is every edge of G. The minimum cardinality of a full dominating set of G is its full domination number γ_FH(G). A full dominating set of G of cardinality γ_FH(G) is called a γ_FH-set of G. We study three types of full domination in graphs: full star domination, where H_v is the maximum star centered at v, full closed domination, where H_v is the subgraph induced by the closed neighborhood of v, and full open domination, where H_v is the subgraph induced by the open neighborhood of v.
Keywords: full domination, full star domination, full closed domination, full open domination 
@article{DMGT_2001_21_1_a3,
     author = {Brigham, Robert and Chartrand, Gary and Dutton, Ronald and Zhang, Ping},
     title = {Full domination in graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {43--62},
     year = {2001},
     volume = {21},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a3/}
}
TY  - JOUR
AU  - Brigham, Robert
AU  - Chartrand, Gary
AU  - Dutton, Ronald
AU  - Zhang, Ping
TI  - Full domination in graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2001
SP  - 43
EP  - 62
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a3/
LA  - en
ID  - DMGT_2001_21_1_a3
ER  - 
%0 Journal Article
%A Brigham, Robert
%A Chartrand, Gary
%A Dutton, Ronald
%A Zhang, Ping
%T Full domination in graphs
%J Discussiones Mathematicae. Graph Theory
%D 2001
%P 43-62
%V 21
%N 1
%U http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a3/
%G en
%F DMGT_2001_21_1_a3
Brigham, Robert; Chartrand, Gary; Dutton, Ronald; Zhang, Ping. Full domination in graphs. Discussiones Mathematicae. Graph Theory, Tome 21 (2001) no. 1, pp. 43-62. http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a3/

[1] T. Gallai, Über extreme Punkt- und Kantenmengen, Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 2 (1959) 133-138.

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

[3] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs: Advanced Topics (Marcel Dekker, New York, 1998).

[4] S.R. Jayaram, Y.H.H. Kwong and H.J. Straight, Neighborhood sets in graphs, Indian J. Pure Appl. Math. 22 (1991) 259-268.

[5] E. Sampathkumar and P.S. Neeralagi, The neighborhood number of a graph, Indian J. Pure Appl. Math. 16 (1985) 126-136.

[6] O. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38 (Amer. Math. Soc. Providence, RI, 1962).