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

Authors:
Matthias Dehmer;Frank Emmert-Streib
Affiliations:
Institute of Discrete Mathematics and Geometry, Vienna University of Technology, TU Vienna, Wiedner Hauptstrasse 8-10, A-1040 Vienna, Austria;University of Washington, Department of Biostatistics, 1705 NE Pacific St, Box 355065, Seattle, WA 98195, USA and University of Washington, Department of Genome Sciences, 1705 NE Pacific St, Box 3 ...
Venue:
Computational Biology and Chemistry
Year:
2008

Citing 2
Cited 1

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Brief Communication: Graphs with maximum connectivity index

Computational Biology and Chemistry

A history of graph entropy measures

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.