fulltext.study @t Gmail

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

Paper ID Volume ID Publish Year Pages File Format Full-Text
15392 1409 2008 8 PDF Available
Title
Structural information content of networks: Graph entropy based on local vertex functionals
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.

Keywords
Structural information content; Graph entropy; Information theory; Gene networks; Chemical graph theory
First Page Preview
Structural information content of networks: Graph entropy based on local vertex functionals
Get Full-Text Now
Don't Miss Today's Special Offer
Price was $35.95
You save - $31
Price after discount Only $4.95
100% Money Back Guarantee
Full-text PDF Download
Online Support
Any Questions? feel free to contact us
Publisher
Database: Elsevier - ScienceDirect
Journal: Computational Biology and Chemistry - Volume 32, Issue 2, April 2008, Pages 131–138
Authors
, ,
Subjects
Physical Sciences and Engineering Chemical Engineering Bioengineering
Get Full-Text Now
Don't Miss Today's Special Offer
Price was $35.95
You save - $31
Price after discount Only $4.95
100% Money Back Guarantee
Full-text PDF Download
Online Support
Any Questions? feel free to contact us