A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class), where the vertices in one class are colored red and those in the other class are colored blue. Let F be a 2-stratified graph rooted at some blue vertex v. An F-coloring of a graph is a red-blue coloring of the vertices of G in which every blue vertex v belongs to a copy of F rooted at v. The F-domination number is the minimum number of red vertices in an F-coloring of G. In this paper, we study F-domination, where F is a 2-stratified red-blue-blue path of order 3 rooted at a blue end-vertex. We present characterizations of connected graphs of order n with F-domination number n or 1 and establish several realization results on F-domination number and other domination parameters.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1317,
author = {Ralucca Gera and Ping Zhang},
title = {On stratification and domination in graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {26},
year = {2006},
pages = {249-272},
zbl = {1142.05026},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1317}
}
Ralucca Gera; Ping Zhang. On stratification and domination in graphs. Discussiones Mathematicae Graph Theory, Tome 26 (2006) pp. 249-272. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1317/
[000] [1] B. Bollobas and E.J. Cockayne, The irredundance number and maximum degree of a graph, Discrete. Math. 49 (1984) 197-199, doi: 10.1016/0012-365X(84)90118-3. | Zbl 0539.05056
[001] [2] G. Chartrand, H. Gavlas, M.A. Henning and R. Rashidi, Stratidistance in stratified graphs, Math. Bohem. 122 (1997) 337-347. | Zbl 0898.05023
[002] [3] G. Chartrand, T.W. Haynes, M.A. Henning and P. Zhang, Stratification and domination in graphs, Discrete Math. 272 (2003) 171-185, doi: 10.1016/S0012-365X(03)00078-5. | Zbl 1028.05074
[003] [4] G. Chartrand, T.W. Haynes, M.A. Henning and P. Zhang, Stratified claw domination in prisms, J. Combin. Math. Combin. Comput. 33 (2000) 81-96. | Zbl 0954.05036
[004] [5] G. Chartrand, L. Holley, R. Rashidi and N.A. Sherwani, Distance in stratified graphs, Czech. Math. J. 125 (2000) 135-146. | Zbl 1033.05031
[005] [6] G. Chartrand and P. Zhang, Introduction to Graph Theory (McGraw-Hill, Boston, 2005). | Zbl 1096.05001
[006] [7] E.J. Cockayne, R.M. Dawes and S.T. Hedetniemi, Total domination in graphs, Networks 10 (1980) 211-219, doi: 10.1002/net.3230100304. | Zbl 0447.05039
[007] [8] G.S. Domke, J.H. Hattingh, S.T. Hedetniemi, R.C. Laskar and L.R. Markus, Restrained domination, preprint.
[008] [9] J.F. Fink and M.S. Jacobson, n-Domination in graphs, in: Y. Alavi and A.J. Schwenk, eds, Graph Theory with Applications to Algorithms and Computer Science, 283-300 (Kalamazoo, MI 1984), Wiley, New York, 1985.
[009] [10] R. Rashidi, The Theory and Applications of Stratified Graphs (Ph.D. Dissertation, Western Michigan University, 1994).