Quantcast

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

Research paper by Matthias M Dehmer, Frank F Emmert-Streib

Indexed on: 05 Feb '08Published on: 05 Feb '08Published in: Computational Biology and Chemistry



Abstract

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