Structural information content of networks: graph entropy based on local vertex functionals

DOI10.1016/j.compbiolchem.2007.09.007zbMath1141.92043OpenAlexW2021831170WikidataQ51895059 ScholiaQ51895059MaRDI QIDQ936078

Frank Emmert-Streib, Matthias Dehmer

Publication date: 12 August 2008

Published in: Computational Biology and Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2007.09.007

zbMATH Keywords

chemical graph theory

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Applications of graph theory to circuits and networks (94C15)

Related Items

Entropy bounds for dendrimers ⋮ Irregular polyomino tiling via integer programming with application in phased array antenna design ⋮ Degree-based entropies of networks revisited ⋮ A gene selection method for cancer classification ⋮ A history of graph entropy measures ⋮ Information processing in complex networks: Graph entropy and information functionals ⋮ Extremality of degree-based graph entropies

Cites Work

• A note on two problems in connexion with graphs
• Entropy splitting for antiblocking corners and perfect graphs
• Elements of Information Theory
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Entropy and the complexity of graphs: III. Graphs with prescribed information content
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item