Author:
Romdhini M.U.,Nawawi A.,Chen C.Y.
Abstract
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.
Publisher
Universiti Putra Malaysia
Reference28 articles.
1. A. Abdollahi, S. Akbari & H. Maimani (2006). Non-commuting graph of a group. Journal of Algebra, 298(2), 468–492. https://doi.org/10.1016/j.jalgebra.2006.02.015.
2. M. Aschbacher (2000). Finite Group Theory. Cambridge University Press, Cambridge, United Kingdom.
3. R. Bapat & S. Pati (2004). Energy of a graph is never an odd integer. Bulletin of Kerala Mathematics Association, 1, 129–132.
4. K. Bhat & G. Sudhakara (2018). Commuting graphs and their generalized complements. Malaysian Journal of Mathematical Sciences, 12(1), 63–84.
5. R. Brauer&K. Fowler (1955). On groups of even order. Annals of Mathematics, 62(3), 565–583. https://doi.org/10.2307/1970080.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献