Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial

Matthias Dehmer, Yongtang Shi and Abbe Mowshowitz

Applied Mathematics and Computation, 2015, vol. 250, issue C, 352-355

Abstract: In this paper we define novel graph measures based on the complex zeros of the partial Hosoya polynomial. The kth coefficient of this polynomial, defined for an arbitrary vertex v of a graph, is the number of vertices at distance k from v. Based on the moduli of the complex zeros, we calculate novel graph descriptors on exhaustively generated graphs as well as on trees. We then evaluate the uniqueness of these measures, i.e., their ability to distinguish between non-isomorphic graphs. Detecting isomorphism for arbitrary graphs remains a challenging problem for which highly discriminating graph invariants are useful heuristics.

Keywords: Discrimination power; Graph measures; Hosoya polynomial (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/S0096300314014143
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:250:y:2015:i:c:p:352-355

DOI: 10.1016/j.amc.2014.10.048

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 ().