The neighbors degree sum (NDS) energy of a graph is determined by the sum of its absolute eigenvalues from its corresponding neighbors degree sum matrix. The non-diagonal entries of NDS−matrix are the summation of the degree of two adjacent vertices, or it is zero for non-adjacent vertices, whereas for the diagonal entries are the negative of the square of vertex degree. This study presents the formulas of neighbors degree sum energies of commuting and non-commuting graphs for dihedral groups of order 2n, D2n, for two cases−odd and even n. The results in this paper comply with the well known fact that energy of a graph is neither an odd integer nor a square root of an odd integer.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.