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-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. (C) 2007 Elsevier Ltd. All rights reserved.
|Number of pages||8|
|Journal||Computational Biology and Chemistry|
|Publication status||Published - Apr 2008|
ASJC Scopus subject areas
- Structural Biology
- Analytical Chemistry
- Physical and Theoretical Chemistry