THE MINIMUM ECCENTRIC-DOMINATING ENERGY OF A GRAPH

Let be a simple graph. A subset of vertices in is said to be an eccentric-dominating set if for each vertex not in , there exists at least one eccentric vertex in and . The cardinality of the minimum eccentric-dominating set is called the eccentric domination number, denoted by . In this article, we define and study the minimum eccentric-dominating energy , and compute the exact value for some standard classes of graphs. Also, we establish some bounds for .