The Dominating Characteristics Of A Total Graph Of A N-Sunlet Graph In Mobile Networking

Abstract

The total graph of an undirected graph J represents the adjacencies and incidences between vertices and edges of J. Let T be a set in U, which is a dominating set of a graph J. Thus, every vertex and edge in (U-T) is adjacent tin J. (J) is a domination number denoting the minimum cardinality of dominating set in J. The domination number of total graphs of n-sunlet graph are determined in this paper.