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

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

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

27 Downloads (Pure)


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.

Original languageEnglish
Article numbere0223745
Number of pages19
JournalPloS one
Issue number11
Publication statusPublished - 14 Nov 2019
MoE publication typeA1 Journal article-refereed

Fingerprint Dive into the research topics of 'Measuring the complexity of directed graphs: A polynomial-based approach'. Together they form a unique fingerprint.

  • Cite this

    Dehmer, M., Chen, Z., Emmert-Streib, F., Tripathi, S., Mowshowitz, A., Levitchi, A., ... Tao, J. (2019). Measuring the complexity of directed graphs: A polynomial-based approach. PloS one, 14(11), [e0223745].