The Minimum Superior Eccentric Dominating Energy of Graphs

Abstract

For a graph  G = (V, E) of order K2 the minimum superior eccentric dominating energy SEed(G) is the sum of the eigen values obtained from the minimum superior eccentric dominating K x K matrix Ased (G) = (Seij) In this paper SEed(G) of standard graphs are computed. Properties, upper and lower bounds for SEed(G) are established.