• M. Bhanumathi
• Sudhasenthil

A subset D of the vertex set V (G) of a graph G is said to be a dominating set if every vertex not in D is adjacent to at least one vertex in D. A dominating set D is said to be an eccentric dominating set if for every v ∈ V − D, there exists at least one eccentric point of v in D. An eccentric dominating set D of G is a nonsplit eccentric dominating set if the induced sub graph < V −D > is connected. The minimum of the cardinalities of the nonsplit eccentric dominating sets of G is called the nonsplit eccentric domination number γnsed(G). In this paper, we have studied the changing and unchanging of Nonsplit eccentric domination number in graphs.

Domination number, distance, eccentricity, radius, diameter, self centered graph, neighborhood, eccentric domination ,nonsplit eccentric domination

" Changing and Unchanging of Nonsplit Eccentric Domination number in graphs.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.45-53, January-2019, Available :http://www.jetir.org/papers/JETIRR006007.pdf

" Changing and Unchanging of Nonsplit Eccentric Domination number in graphs.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp45-53, January-2019, Available at : http://www.jetir.org/papers/JETIRR006007.pdf