A Study on Minimum Efficient Dominating Extended Energy of Some Graphs

Abstract

By the inspiration of the work extended adjacency matrix[11], the concept of minimum efficient dominating extended matrix is established. In this manuscript, minimum efficient dominating extended matrix  is calculated using the degree of the nodes and hence energy is obtained by the sum of the latent values of the matrix . The minimum efficient dominating extended energy   for complete graph, crown graph, friendship graph, cycle graph and path graph are estimated. Also the assets and restrictions of minimum efficient dominating extended energy are also calculated.