TY - JOUR
T1 - Structural information content of networks
T2 - Graph entropy based on local vertex functionals
AU - Dehmer, Matthias
AU - Emmert-Streib, Frank
PY - 2008/4
Y1 - 2008/4
N2 - 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.
AB - 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.
KW - Chemical graph theory
KW - Gene networks
KW - Graph entropy
KW - Information theory
KW - Structural information content
U2 - 10.1016/j.compbiolchem.2007.09.007
DO - 10.1016/j.compbiolchem.2007.09.007
M3 - Article
VL - 32
SP - 131
EP - 138
JO - Computational Biology and Chemistry
JF - Computational Biology and Chemistry
SN - 1476-9271
IS - 2
ER -