A note on 0 T Domination

Abstract

is called a dominating set if every vertex in G is either in D or is adjacent to an element of D . A simple graph G is said to be 0 T , if for any two distinct vertices u and v of , G either one of u and v is isolated or there exists an edge e such that either e is incident with u but not with v or e is incident with v but not with u . If D of a dominating set D of the graph G is a 0 T graph, then it is called a 0