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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado en:PLoS One
Autores principales: Dehmer, Matthias, Chen, Zengqiang, Emmert-Streib, Frank, Tripathi, Shailesh, Mowshowitz, Abbe, Levitchi, Alexei, Feng, Lihua, Shi, Yongtang, Tao, Jin
Formato: Artigo
Lenguaje:Inglês
Publicado: Public Library of Science 2019
Materias:
Research Article
Acceso en línea:https://ncbi.nlm.nih.gov/pmc/articles/PMC6855486/
https://ncbi.nlm.nih.gov/pubmed/31725742
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0223745
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares