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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
