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

  title={Structural information content of networks: Graph entropy based on local vertex functionals},
  author={Matthias Dehmer and Frank Emmert-Streib},
  journal={Computational biology and chemistry},
  volume={32 2},
In this paper we define the structural information content of graphs as their corresponding graph entropy. This definition is based on local vertex functionals obtained by calculating j-spheres via the algorithm of Dijkstra. We prove that the graph entropy and, hence, the local vertex functionals can be computed with polynomial time complexity enabling the application of our measure for large graphs. In this paper we present numerical results for the graph entropy of chemical graphs and discuss… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 15 references

Information Theoretic Indices for Characterization of Chemical Structures

  • D. Bonchev
  • Comput. Biol. Chem
  • 1983
Highly Influential
20 Excerpts

Metrical analysis of graphs

  • V. A. Skorobogatov, A. A. Dobrynin
  • 1988
Highly Influential
3 Excerpts

Life , information theory , and topology

  • N. Rashewsky
  • Bull . Math . Biophys .
  • 1955
Highly Influential
4 Excerpts

Combinatorial graph complexity. Atti

  • B. D. McKay
  • Graph isomorphisms. Congressus Numerantium
  • 1981
1 Excerpt

Combinatorial graph complexity

  • D. Minoli
  • Atti . Accad . Naz . Lincei , VIII . Ser . , Rend…
  • 1975
1 Excerpt

On characterization of molecular branching

  • M. Randić
  • J. Am. Chem. Soc
  • 1975
3 Excerpts

Coding of an information source having ambiguous alphabet and the entropy of graphs

  • J. Körner
  • Soc. Jpn
  • 1973
2 Excerpts

Similar Papers

Loading similar papers…