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

Computational Biology and Chemistry

Volumn 32, Issue 2, 2008, Pages 131-138

  Dehmer, Matthias ^a   Emmert Streib, Frank ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Chemical graph theory; Gene networks; Graph entropy; Information theory; Structural information content

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS;

GRAPH ENTROPY; VERTEX FUNCTIONALS;

INFORMATION THEORY;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; CHEMICAL MODEL; COMPUTER GRAPHICS; ENTROPY; MATHEMATICAL COMPUTING; METHODOLOGY; PHYSICAL CHEMISTRY; STATISTICS;

ALGORITHMS; CHEMISTRY, PHYSICAL; COMPUTER GRAPHICS; ENTROPY; MODELS, CHEMICAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED;

EID: 40049085450     PISSN: 14769271     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compbiolchem.2007.09.007     Document Type: Article

References (21)

1. Bonchev D. Information Theoretic Indices for Characterization of Chemical Structures (1983), Research Studies Press, Chichester
2. Bonchev D. Complexity in Chemistry. Introduction and Fundamentals (2003), Taylor and Francis
3. Caporossi G., Gutman I., Hansen P., and Pavlovi L. Graphs with maximum connectivity index. Comput. Biol. Chem. 27 1 (2003) 85-90
4. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), MIT Press
5. Cover T.M., and Thomas J.A. Elements of Information Theory. Wiley Series in Telecommunications and Signal Processing (2006), Wiley& Sons
6. Cramer C.J. Essentials of Computational Chemistry: Theories and Models (2004), Wiley Publishing
7. Csiszár I., Körner J., Lovász L., Marto K., and Simonyi G. Entropy splitting for antiblocking corners and perfect graphs. Combinatorica 10 1 (1990) 27-40
8. Dijkstra E.W. A note on two problems in connection with graphs. Numerische Math. 1 (1959) 269-271
9. Gutman I., and Polansky O.E. Mathematical Concepts in Organic Chemistry (1986), Springer
10. Harary F. Graph Theory (1969), Addison Wesley Publishing Company
11. Hosoya H. Topological index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bull. Chem. Soc. Jpn. 44 (1971) 2332-2339
12. Körner J. Coding of an information source having ambiguous alphabet and the entropy of graphs. Transactions of the 6th Prague Conference on Information Theory (1973) 411-425
13. McKay B.D. Graph isomorphisms. Congressus Numerantium 730 (1981) 45-87
14. Minoli, D., 1975. Combinatorial graph complexity. Atti. Accad. Naz. Lincei, VIII. Ser., Rend., Cl. Sci. Fis. Mat. Nat. 59, 651-661.
15. Mowshowitz A. Entropy and the complexity of graphs. iii: Graphs with prescribed information content. Bull. Math. Biophys. 30 (1968) 387-414
16. Mowshowitz A. Entropy and the complexity of the graphs. i: An index of the relative complexity of a graph. Bull. Math. Biophys. 30 (1968) 175-204
17. Randić M. On characterization of molecular branching. J. Am. Chem. Soc. 97 (1975) 6609-6615
18. Rashewsky N. Life, information theory, and topology. Bull. Math. Biophys. 17 (1955) 229-235
19. Simonyi G. Perfect graphs and graph entropy. An updated survey. In: Ramirez-Alfonsin J., and Reed B. (Eds). Perfect Graphs (2001), John Wiley & Sons pp. 293-328
20. Skorobogatov V.A., and Dobrynin A.A. Metrical analysis of graphs. MATCH 23 (1988) 105-155
21. Trucco E. A note on the information content of graphs. Bull. Math. Biol. 18 2 (1956) 129-135