Total Eccentric domination in Graphs

M. Bhanumathi, J. John Flavia


Volume :5 , Issue :2 ,Page :49-65



Abstract :A set S  V(G) is a total eccentric dominating set if S is an eccentric dominating set and also the induced sub graph  S  has no isolated vertices. The card inality of minimum total eccentric dominating set is called the total eccentric domination number and is denoted by ߛ ௧௘ ሻܩሺ . In this paper, we present several bounds on the total eccentric domination number and exact values of some particular graphs.



  • Download PDF