The Minimum Dominating Seidel Energy of Some Graphs
Abstract
M.R. Rajesh Kanna et al defined the minimum dominating seidel energy, ESd(G) of some families of graphs such as, Star graph, Complete graph, Crown graph and Cocktail graphs. Motivated by this, we obtained the minimum dominating seidel energy of Book graph and Friendship graphs. Relation between domination number, energy and rank of minimum dominating seidel matrix of graphs are also established.