Structure of squares and efficient domination in graph classes

For any two vertices u and v in a graph G, dG(u,v) denote the distance between u and v in G. The square of a graph G=(V,E) is the graph G2=(V,E2) such that uv∈E2 if and only if dG(u,v)∈{1,2}. An efficient dominating set (e.d. for short) in G is a subset D of vertices such that D is an independent se...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2016-11, Vol.652, p.38-46
1. Verfasser:	Karthick, T.
Format:	Artikel
Sprache:	eng
Schlagworte:	Domination Efficient domination Graph algorithms Graph classes Graph theory Graphs Square graph
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!