Volume : III, Issue : VII, July - 2014

Equitable Cototal Domination in Graphs

B. Basavanagoud, Vijay V. Teli

Abstract :

Let G=(V,E) be a simple graph. A subset D of V is called an equitable dominating set if for every v∈V-D, there exists a vertex u∈D such that uv∈E(G) and |deg(u)-deg(v)|≤1, where deg(u) and deg(v) denotes the degree of a vertex u and degree of a vertex v respectively. An equitable dominating set D is said to be an equitable cototal dominating set (ecdset) if the induced subgraph ⟨V-D⟩ has no isolated vertices. The equitable cototal domination number γ_ct^e (G) of a graph G is the minimum cardinality of an ecd-set of G. In this paper, we obtain some bounds on γ_ct^e (G) and its exact values for some standard class of graphs are found.

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

Dr. B. Basavanagoud, Vijay V. Teli Equitable Cototal Domination in Graphs International Journal of Scientific Research, Vol : 3, Issue : 7 July 2014

Number of Downloads : 974

References :