Assume we have a set of k colors and to each vertex of a graph G we assign an arbitry of these colors. If we require that each vertex to set is assigned has in its closed neighborhood all k colors, then this is called the generalized k-rainbow dominating function of a graph G. The corresponding γgkr, which is the minimum sum of numbers of assigned colores over all vertices of G, is called the gk-rainbow domination number of G. In this paper we present a linear algorithms for determining a minimum generalized 2-rainbow dominating set of a tree and on GP(n,2).
Shirdel, G. H., Ghanbari, M., & Ramezani, M. (2023). Generalized k-Rainbow and Generalized 2-Rainbow Domination in Graphs. Analytical and Numerical Solutions for Nonlinear Equations, 8(1), 29-35. doi: 10.22128/gadm.2024.761.1100
MLA
Gholam Hassan Shirdel; Mojtaba Ghanbari; Mitra Ramezani. "Generalized k-Rainbow and Generalized 2-Rainbow Domination in Graphs", Analytical and Numerical Solutions for Nonlinear Equations, 8, 1, 2023, 29-35. doi: 10.22128/gadm.2024.761.1100
HARVARD
Shirdel, G. H., Ghanbari, M., Ramezani, M. (2023). 'Generalized k-Rainbow and Generalized 2-Rainbow Domination in Graphs', Analytical and Numerical Solutions for Nonlinear Equations, 8(1), pp. 29-35. doi: 10.22128/gadm.2024.761.1100
VANCOUVER
Shirdel, G. H., Ghanbari, M., Ramezani, M. Generalized k-Rainbow and Generalized 2-Rainbow Domination in Graphs. Analytical and Numerical Solutions for Nonlinear Equations, 2023; 8(1): 29-35. doi: 10.22128/gadm.2024.761.1100
)