2-Rainbow Domination Number of Some Graphs
| dc.contributor.author | Derya Doğan DURGUN | |
| dc.contributor.author | Ferhan Nihan ALTUNDAĞ | |
| dc.date.accessioned | 2024-07-24T09:12:38Z | |
| dc.date.available | 2024-07-24T09:12:38Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | A 2-rainbow domination function of a graph G is a function f that assigns to each vertex a set of colors chosen from the set {1,2}, such that for any ? ( ), ( ) = ? implies ? ? ( ) | ( )| ={1,2}. The 2-rainbow domination number 2( ) of a graph G is minimum w ( ) = ? ? ( )| ( )|over all such functions f. In this paper, we show that upper bounds of 2-rainbow domination numbers of several classes of graphs. | |
| dc.identifier.issn | 1305-130X | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/24652 | |
| dc.language.iso | eng | |
| dc.title | 2-Rainbow Domination Number of Some Graphs | |
| dc.type | Araştırma Makalesi |