Disprove of a conjecture 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:	Aequationes mathematicae 2024-02, Vol.98 (1), p.241-260
Hauptverfasser:	Shao, Z., Khoeilar, R., Karami, H., Chellali, M., Sheikholeslami, S. M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Analysis Apexes Combinatorics Graphs Mathematical functions Mathematics Mathematics and Statistics Minimum weight Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!