Roman {k}-domination in trees and complexity results for some classes of graphs

In this paper, we study Roman { k }-dominating functions on a graph G with vertex set V for a positive integer k : a variant of { k }-dominating functions, generations of Roman { 2 } -dominating functions and the characteristic functions of dominating sets, respectively, which unify classic dominati...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization 2021-07, Vol.42 (1), p.174-186
Hauptverfasser:	Wang, Cai-Xia, Yang, Yu, Wang, Hong-Juan, Xu, Shou-Jun
Format:	Artikel
Sprache:	eng
Schlagworte:	Characteristic functions Combinatorics Convex and Discrete Geometry Graphs Integers Mathematical functions Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Parameters Theory of Computation Trees (mathematics) Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!