IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0223745.html
   My bibliography  Save this article

Measuring the complexity of directed graphs: A polynomial-based approach

Author

Listed:
  • Matthias Dehmer
  • Zengqiang Chen
  • Frank Emmert-Streib
  • Shailesh Tripathi
  • Abbe Mowshowitz
  • Alexei Levitchi
  • Lihua Feng
  • Yongtang Shi
  • Jin Tao

Abstract

In this paper, we define novel graph measures for directed networks. The measures are based on graph polynomials utilizing the out- and in-degrees of directed graphs. Based on these polynomial, we define another polynomial and use their positive zeros as graph measures. The measures have meaningful properties that we investigate based on analytical and numerical results. As the computational complexity to compute the measures is polynomial, our approach is efficient and can be applied to large networks. We emphasize that our approach clearly complements the literature in this field as, to the best of our knowledge, existing complexity measures for directed graphs have never been applied on a large scale.

Suggested Citation

  • Matthias Dehmer & Zengqiang Chen & Frank Emmert-Streib & Shailesh Tripathi & Abbe Mowshowitz & Alexei Levitchi & Lihua Feng & Yongtang Shi & Jin Tao, 2019. "Measuring the complexity of directed graphs: A polynomial-based approach," PLOS ONE, Public Library of Science, vol. 14(11), pages 1-19, November.
    • Handle: RePEc:plo:pone00:0223745
    DOI: 10.1371/journal.pone.0223745
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0223745
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0223745&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0223745?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0223745. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.