Secure domination in proper interval graphs

A subset S of vertices in a graph G is a secure dominating set of G if S is a dominating set of G and, for each vertex u∉S, there is a vertex v∈S such that uv is an edge and (S∖{v})∪{u} is also a dominating set of G. The secure domination number γs(G) is the cardinality of a smallest secure dominati...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2018-10, Vol.247, p.70-76
Hauptverfasser:	Araki, Toru, Miyazaki, Hiroka
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Domination Finite element analysis Graph theory Graphs Linear time algorithm Polynomials Powers of a path Proper interval graphs Secure domination
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!