Strong Equality Between the 2-Rainbow Domination and Independent 2-Rainbow Domination Numbers in Trees

A 2- rainbow dominating function (2RDF) on a graph G = ( V , E ) is a function f from the vertex set V to the set of all subsets of the set { 1 , 2 } such that for any vertex v ∈ V with f ( v ) = ∅ the condition ⋃ u ∈ N ( v ) f ( u ) = { 1 , 2 } is fulfilled. A 2RDF f is independent (I2RDF) if no tw...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Bulletin of the Malaysian Mathematical Sciences Society 2016-06, Vol.39 (Suppl 1), p.205-218
Hauptverfasser:	Amjadi, J., Falahat, M., Sheikholeslami, S. M., Rad, N. Jafari
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Mathematical functions Mathematics Mathematics and Statistics Minimum weight Trees Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!