IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v250y2015icp352-355.html
   My bibliography  Save this article

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

Author

Listed:
  • Dehmer, Matthias
  • Shi, Yongtang
  • Mowshowitz, Abbe

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.

Suggested Citation

  • Dehmer, Matthias & Shi, Yongtang & Mowshowitz, Abbe, 2015. "Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 352-355.
    • Handle: RePEc:eee:apmaco:v:250:y:2015:i:c:p:352-355
    DOI: 10.1016/j.amc.2014.10.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314014143
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.10.048?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Matthias Dehmer & Martin Grabner & Boris Furtula, 2012. "Structural Discrimination of Networks by Using Distance, Degree and Eigenvalue-Based Measures," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-15, July.
    2. Matthias Dehmer & Laurin A J Mueller & Armin Graber, 2010. "New Polynomial-Based Molecular Descriptors with Low Degeneracy," PLOS ONE, Public Library of Science, vol. 5(7), pages 1-6, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dehmer, M. & Moosbrugger, M. & Shi, Y., 2015. "Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 164-168.
    2. Lang, Rongling & Li, Tao & Mo, Desen & Shi, Yongtang, 2016. "A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 115-121.
    3. Matthias Dehmer & Frank Emmert-Streib & Yongtang Shi & Monica Stefu & Shailesh Tripathi, 2015. "Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-10, October.
    4. Yang, Yu & Liu, Hongbo & Wang, Hua & Fu, Hongsun, 2015. "Subtrees of spiro and polyphenyl hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 547-560.
    5. Ghorbani, Modjtaba & Hakimi-Nezhaad, Mardjan & Dehmer, Matthias, 2022. "Novel results on partial hosoya polynomials: An application in chemistry," Applied Mathematics and Computation, Elsevier, vol. 433(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Matthias Dehmer & Frank Emmert-Streib & Yongtang Shi & Monica Stefu & Shailesh Tripathi, 2015. "Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-10, October.
    2. Dehmer, M. & Moosbrugger, M. & Shi, Y., 2015. "Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 164-168.
    3. Brezovnik, Simon & Dehmer, Matthias & Tratnik, Niko & Žigert Pleteršek, Petra, 2023. "Szeged and Mostar root-indices of graphs," Applied Mathematics and Computation, Elsevier, vol. 442(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:250:y:2015:i:c:p:352-355. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.