The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs

DOI10.1016/j.physa.2015.12.055zbMath1400.05062OpenAlexW2221916508MaRDI QIDQ1619196

Marco Breda, Masoud Asadi-Zeydabadi, Massimo Buscema, Weldon Alexander Lodwick

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.12.055

zbMATH Keywords

graph indexgraph complexitygraph pruning

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Toward a precision, complexity-informed cultural policy design: structural bottlenecks to culture-led development in Skaraborg, Sweden

Uses Software

• Pajek

Cites Work

• Statistical mechanics of complex networks
• Dynamical Processes on Complex Networks
• An Algorithm for Subgraph Isomorphism
• A graph distance metric based on the maximal common subgraph
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• Graph-Based Representations in Pattern Recognition
• Retrieving Topological Information for Phase Field Models

This page was built for publication: The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs