Minimum Eccentric Dominating Energy of Graphs

- In this paper, for a graph 𝐺 = (𝑉, 𝐸) of order 𝑘 , the minimum eccentric dominating energy 𝔼 𝑒𝑑 (𝐺) is the sum of the eigenvalues obtained from the minimum eccentric dominating 𝑘 × 𝑘 matrix 𝔸 𝑒𝑑 (𝐺) . 𝔼 𝑒𝑑 (𝐺) of standard graphs are computed. Properties, upper and lower bounds for 𝔼 𝑒𝑑 (𝐺) are established.