Detour D – Eccentric Domination in Graphs

Main Article Content

Prasanna A, Mohamedazarudeen N

Abstract

A dominating set S V is said to be a detour eccentric dominating set in G (V, E) if for every u in    V – S, there exists at least a detour eccentric vertex v of u in S. A dominating set D is said to be a     D – eccentric dominating set in a graph G if for every u in V – D, there exists at least a D – eccentric vertex v of u in D. In this paper, the detour D – eccentric dominating set and its numbers are introduced. The bounds on detour D – eccentric numbers are obtained for some well-known graphs. Theorems related to the above concepts are stated and proved

Article Details

Section
Articles