The Minimum Dominating Seidel Energy of Some Graphs

  • V. M. Arul Flower Mary, Victoria Jayafin Nisha S L, M. Regees
Keywords: minimum dominating set, minimum dominating seidel matrix, minimum dominating seidel eigenvalues, minimum dominating seidel energy of a graph.

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.

Published
2021-08-24
How to Cite
M. Regees, V. M. A. F. M. V. J. N. S. L. (2021). The Minimum Dominating Seidel Energy of Some Graphs. Design Engineering, 3145- 3152. Retrieved from http://www.thedesignengineering.com/index.php/DE/article/view/3670
Section
Articles