Full domination in graphs
Robert C. Brigham ; Gary Chartrand ; Ronald D. Dutton ; Ping Zhang
Discussiones Mathematicae Graph Theory, Tome 21 (2001), p. 43-62 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

For each vertex v in a graph G, let there be associated a subgraph Hv of G. The vertex v is said to dominate Hv as well as dominate each vertex and edge of Hv. 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 Hv is the maximum star centered at v, full closed domination, where Hv is the subgraph induced by the closed neighborhood of v, and full open domination, where Hv is the subgraph induced by the open neighborhood of v.

Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:270252 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1132,
     author = {Robert C. Brigham and Gary Chartrand and Ronald D. Dutton and Ping Zhang},
     title = {Full domination in graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {21},
     year = {2001},
     pages = {43-62},
     zbl = {0999.05078},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1132}
}

Robert C. Brigham; Gary Chartrand; Ronald D. Dutton; Ping Zhang. Full domination in graphs. Discussiones Mathematicae Graph Theory, Tome 21 (2001) pp. 43-62. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1132/

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

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

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

[003] [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. | Zbl 0733.05074

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

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