On 2-Rainbow Domination of some Families of Graphs
M. T. Rahim, Murtaza Ali, Muhammad Haider Zeb, Gohar Ali
Abstract
M. T. Rahim, Murtaza Ali, Muhammad Haider Zeb, Gohar Ali
Abstract
In this paper we find the $2-$rainbow domination number of the $4$-regular Harary graphs $H_{4,n}$, $n\geq 5$. Upper bound for the $2$-rainbow domination number of $P_1\times P_m$ is found. At the end we find the lower bound for the $2$-rainbow domination number of $k$-regular graphs.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we find the $2-$rainbow domination number of the $4$-regular Harary graphs $H_{4,n}$, $n\geq 5$. Upper bound for the $2$-rainbow domination number of $P_1\times P_m$ is found. At the end we find the lower bound for the $2$-rainbow domination number of $k$-regular graphs.
Key concepts: Rainbow, Domination analysis, Combinatorics, Upper and lower bounds, Mathematics, Discrete mathematics, Graph, Physics