Independent Restrained k - Rainbow Dominating Function
Let G be a graph and let f be a function that assigns to each vertex a set of colors chosen from the set {1, 2…, k} that is f: V(G) P [1,2,…,k]. If for each vertex v V(G) such that f(v) = .we have then f is called the k – Rainbow Dominating Function (KRDF) of G. A k – Rainbow Dominating Function...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Accademia Piceno Aprutina dei Velati
2022-12-01
|
| Rangatū: | Ratio Mathematica |
| Ngā marau: | |
| Urunga tuihono: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/924 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|