Loading...
Please wait, while we are loading the content...
Similar Documents
The Rainbow Domination Subdivision Numbers of Graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Dehgardi, Nasrin Sheikholeslami, Seyed Mahmoud Volkmann, Lutz |
| Copyright Year | 2015 |
| Abstract | A 2-rainbow dominating function (2RDF) of 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 for any vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is fulfilled. The weight of a 2RDF f is the value ω(f) = Σv∈V |f(v)|. The 2-rainbow domination number of a graph G, denoted by γr2(G), is the minimum weight of a 2RDF of G. The 2-rainbow domination subdivision number sdγr2 (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the 2-rainbow domination number. In this paper, we initiate the study of 2-rainbow domination subdivision number in graphs. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://emis.maths.tcd.ie/EMIS/journals/MV/152/mv15203.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Dominating set Graph (discrete mathematics) Graph - visual representation Minimum weight Subdivision surface Vertex |
| Content Type | Text |
| Resource Type | Article |
