2011International Journal of Mathematics and Soft ComputingRequires access

On 2-Rainbow Domination of some Families of Graphs

M. T. Rahim, Murtaza Ali, Muhammad Haider Zeb, Gohar Ali

Open publisher page 5 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Rainbow, Domination analysis, Combinatorics, Upper and lower bounds, Mathematics, Discrete mathematics, Graph, Physics

Related papers

Back to paper searchBrowse research topicsOriginal source
On 2-Rainbow Domination of some Families of Graphs — Research Paper | ScholarLens