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

M. Dehmer, M. Moosbrugger and Y. Shi

Applied Mathematics and Computation, 2015, vol. 268, issue C, 164-168

Abstract: 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.

Keywords: Discrimination power; Graph measures; Randić matrix (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031500586X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:268:y:2015:i:c:p:164-168

DOI: 10.1016/j.amc.2015.04.115

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().