Locating–dominating sets in twin-free graphs

A locating–dominating set of a graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u)∩D≠N(v)∩D where N(u) denotes the open neighborhood of u. A graph is twin-free...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2016-02, Vol.200, p.52-58
Hauptverfasser:	Foucaud, Florent, Henning, Michael A., Löwenstein, Christian, Sasse, Thomas
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Construction Dominating sets Graph theory Graphs Locating–dominating sets Mathematical analysis Mathematics Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!