Closeness Energy of Non-Commuting Graph for Dihedral Groups

EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS(2024)

引用 0|浏览1
暂无评分
摘要
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. 2020 Mathematics Subject Classifications: 05C25, 05C50, 15A18, 20D99
更多
查看译文
关键词
Words and Phrases,Closeness matrix,Energy of a graph,Non-commuting graph,Dihedral Groups
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要