| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 345 5 |
| Ultima descărcare din IBN: 2022-08-15 13:25 |
| Căutarea după subiecte similare conform CZU |
| 519.17 (67) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012KHOEILAR, Rana, KHEIBARI, Mahla, CHELLALI, Mustapha, SHEIKHOLESLAMI, Seyed Mahmoud. A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two. In: Computer Science Journal of Moldova, 2020, nr. 3(84), pp. 373-388. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 3(84) / 2020 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.17 | ||||||
| MSC 2010: 05C69 | ||||||
| Pag. 373-388 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
An independent 2-rainbow dominating function (I2-RDF) on a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2} such that {x ∈ V | f(x) 6= ∅} is an independent set of G and for any vertex v ∈ V (G) with f(v) = ∅ we have Su2N(v) f(u) = {1, 2}. The weight of an I2-RDF f is the value !(f) = Pv2V |f(v)|, and the independent 2-rainbow domination number ir2(G) is the minimum weight of an I2-RDF on G. In this paper, we prove that if G is a graph of order n ≥ 3 with minimum degree at least two such that the set of vertices of degree at least 3 is independent, then ir2(G) ≤ 4n 5 . |
||||||
| Cuvinte-cheie independent k-rainbow dominating function, independent k-rainbow domination number |
||||||
|
|
|
|
