Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix

详细信息    查看全文

• 作者：M. Dehmer ; ^a ; ^{matthias.dehmer@umit.at" class="auth_mail" title="E-mail the corresponding author} ; ^{matthias.dehmer@univie.ac.at" class="auth_mail" title="E-mail the corresponding author} ; M. Moosbrugger^a ; ^{miriana.moosbrugger@umit.at" class="auth_mail" title="E-mail the corresponding author} ; Y. Shi^b ; ^{shi@nankai.edu.cn" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Discrimination power ; Graph measures ; Randić matrix
• 刊名：Applied Mathematics and Computation
• 出版年：2015
• 出版时间：1 October 2015
• 年：2015
• 卷：268
• 期：Complete
• 页码：164-168
• 全文大小：275 K

文摘

In this paper we define novel graph measures based on the zeros of the characteristic polynomial by using the Randić matrix. We compute the novel graph descriptors on exhaustively generated graphs and trees and demonstrate that the measures encode their structural information uniquely. These results are compared with the same graph measures but based on the eigenvalues of the classical characteristic polynomial of a graph. Finally we interpret our findings that are evidenced by numerical results.