Italian domination in trees

The Roman domination number and Italian domination number (also known as the Roman {2}-domination number) are graph labeling problems in which each vertex is labeled with either 0, 1, or 2. In the Roman domination problem, each vertex labeled 0 must be adjacent to at least one vertex labeled 2. In t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2017-01, Vol.217, p.557-564
Hauptverfasser:	Henning, Michael A., Klostermeyer, William F.
Format:	Artikel
Sprache:	eng
Schlagworte:	Dominating set Geometry Graphs Labeling Labels Marking Roman [formula omitted]-dominating set Studies Tree Trees Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!