Cargando…
Measuring the complexity of directed graphs: A polynomial-based approach
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...
Autores principales: | Dehmer, Matthias, Chen, Zengqiang, Emmert-Streib, Frank, Tripathi, Shailesh, Mowshowitz, Abbe, Levitchi, Alexei, Feng, Lihua, Shi, Yongtang, Tao, Jin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6855486/ https://www.ncbi.nlm.nih.gov/pubmed/31725742 http://dx.doi.org/10.1371/journal.pone.0223745 |
Ejemplares similares
-
Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices
por: Dehmer, Matthias, et al.
Publicado: (2015) -
A Note on Graphs with Prescribed Orbit Structure
por: Mowshowitz, Abbe, et al.
Publicado: (2019) -
Structural Differentiation of Graphs Using Hosoya-Based Indices
por: Dehmer, Matthias, et al.
Publicado: (2014) -
Mathematical foundations and applications of graph entropy
por: Dehmer, Matthias, et al.
Publicado: (2016) -
On Properties of Distance-Based Entropies on Fullerene Graphs
por: Ghorbani, Modjtaba, et al.
Publicado: (2019)