Closeness Energy of Non-Commuting Graph for Dihedral Groups
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i1.5020Keywords:
Closeness matrix, Energy of a graph, Non-commuting graph, Dihedral GroupsAbstract
This paper focuses on the non-commuting graph for dihedral groups of order 2n, D2n, where n ≥ 3. We show the spectrum and energy of the graph corresponding to the closeness matrix. The result is that the obtained energy is always twice its spectral radius and is never an odd integer. Moreover, it is classified as hypoenergetic.
Downloads
Published
2024-01-31
Issue
Section
Nonlinear Analysis
License
Copyright (c) 2024 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.
How to Cite
Closeness Energy of Non-Commuting Graph for Dihedral Groups. (2024). European Journal of Pure and Applied Mathematics, 17(1), 212-221. https://doi.org/10.29020/nybg.ejpam.v17i1.5020