A lower bound on the double outer-independent domination number of a tree

A vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph is a set of vertices of such that every vertex of is dominated by at least two vertices of , and the set ( ) \ is independent. The double outer-independent domination number...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Demonstratio mathematica 2012-03, Vol.45 (1), p.17-23
1. Verfasser:	Krzywkowski, Marcin
Format:	Artikel
Sprache:	eng
Schlagworte:	05C05 05C69 double domination double outer-independent domination tree
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!