Connected equitable domination in graphs

Sivakumar, S. and Soner, N. D. and Alwardi, A. and Deepak, G. (2012) Connected equitable domination in graphs. Pure Mathematical Sciences, 1 (1-4).

[img] Text (Full Text)
Connected Equitable Domination in Graphs.pdf - Published Version
Restricted to Registered users only

Download (101kB) | Request a copy
Official URL:


Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for every v . V -D, there exists a vertex v . D such that uv . E(G) and |deg(u) - deg(v)| = 1, where deg(u) is the degree of u and deg(v) is the degree of v in G. An equitable dominating set D is said to be a connected equitable dominating set if the subgraph �D� induced by D is connected. The minimum of the cardinalities of the connected equitable dominating sets of G is called the connected equitable domination number and denoted by .ce(G) In this paper we introduce the connected equitable domination and connected equitable domatic in a graph, bounds for .ce(G), dce(G) and its exact values for some standard graphs are found.

Item Type: Article
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: C Swapna Library Assistant
Date Deposited: 31 Aug 2019 06:32
Last Modified: 31 Aug 2019 06:32

Actions (login required)

View Item View Item