Minimum Eccentric Dominating Energy of Graphs

R. Tejaskumar, A. Mohamed Ismayil, Δ°van Gutman Β· International Journal of Mathematics Trends and Technology Β· 2023

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.

Read the paper Β· More papers on PaperTik