Total Outer Equitable Connected Domination of a Graph
Jayaprakash M. C, G. Deepak · International Journal of Mathematics Trends and Technology · 2014
Let G = (V, E) be a graph. A set D V (G) is equitable dominating set of G if v V – D a vertex u D such that uv E (G) and |d(u) – d(v)| 1. A set D V (G) is outer equitable dominating set if D is equitable dominating and is connected graph. The outer equitable connected domination number of G is the minimum cardinality of the outer-equitable connected dominating set of G and is denoted by oec(G). We introduce in this paper the concept of total outer equitable connected domination, exact values for some particular classes of graphs are found, some results on total outer equitable domination number are also established.