2017
DOI: 10.1080/23799927.2017.1330282
|View full text |Cite
|
Sign up to set email alerts
|

A sufficient condition for large rainbow domination number

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
6
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…Given a graph G, the minimum weight of a k-rainbow dominating function is called the k-rainbow domination number of G, which we denote by γ k r (G). The concept of rainbow domination was introduced in [8] and has been studied extensively [9][10][11][12][13][14][15].…”
Section: Theorem 11 ([2]): Let G Be a Graph A Subset I Of V(g)mentioning
confidence: 99%
“…Given a graph G, the minimum weight of a k-rainbow dominating function is called the k-rainbow domination number of G, which we denote by γ k r (G). The concept of rainbow domination was introduced in [8] and has been studied extensively [9][10][11][12][13][14][15].…”
Section: Theorem 11 ([2]): Let G Be a Graph A Subset I Of V(g)mentioning
confidence: 99%
“…In both cases the problem of computing an invariant on the generalized prism G 2 K k was reduced to a problem of finding the value of the corresponding invariant on the factor G, which is sometimes easier to consider, see for example [2,9,10,19].…”
mentioning
confidence: 99%
“…For k ≥ 8, based on the results of J. Amjadi et al (2017), γ rk (C n 2C m ) = mn. For (4 ≤ k ≤ 7), we give a proof for the new lower bound of γ r4 (C n 2C 3 ).…”
mentioning
confidence: 99%
“…Corollary 1. ( [21]) Let k be a positive integer, and let G be a graph of order n. If k ≥ 2∆(G), then γ rk (G) = n.…”
mentioning
confidence: 99%