Total domination in lict graph

For any graph G = (V, E), lict graph [eta](G) of a graph G is the graph whose vertex set is the union of the set of edges and the set of cut vertices of G in which two vertices are adjacent if and only if the corresponding edges are adjacent or the corresponding members of G are incident. A dominati...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of mathematical combinatorics 2014-03, Vol.1, p.19-19
Hauptverfasser:	V.R., Girish, Usha, P
Format:	Artikel
Sprache:	eng
Schlagworte:	Analysis Combinatorial analysis Combinatorics Graph theory Graphs Mathematical analysis Unions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!