An upper bound on the double Roman domination number

A double Roman dominating function (DRDF) on a graph G = ( V , E ) is a function f : V → { 0 , 1 , 2 , 3 } having the property that if f ( v ) = 0 , then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f ( w ) = 3 , and if f ( v ) = 1 , then vertex v must have at...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization 2018-07, Vol.36 (1), p.81-89
Hauptverfasser:	Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S. M., Volkmann, L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Convex and Discrete Geometry Decision trees Mathematical functions Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Minimum weight Operations Research/Decision Theory Optimization Theory of Computation Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!