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

M. Dehmer, Frank Emmert-Streib

Research output: Contribution to journalArticlepeer-review

34 Citations (Scopus)

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-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.
Original languageEnglish
Pages (from-to)131-138
Number of pages8
JournalComputational Biology and Chemistry
Volume32
Issue number2
DOIs
Publication statusPublished - Apr 2008

ASJC Scopus subject areas

  • Biochemistry
  • Structural Biology
  • Analytical Chemistry
  • Physical and Theoretical Chemistry

Fingerprint Dive into the research topics of 'Structural information content of networks: Graph entropy based on local vertex functionals'. Together they form a unique fingerprint.

Cite this