On extremal properties of graph entropies

Match

Volumn 68, Issue 3, 2012, Pages 889-912

  Dehmer, Matthias ^a   Kraus, Veronika ^a  

^a UNIVERSITY FOR HEALTH SCIENCES   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880827931     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (39)

1. D. Bonchev, Information Theoretic Indices for Characterization of Chemical Structures, Research Studies Press, Chichester, 1983.
2. L. da F. Costa, F. Rodrigues, G. Travieso, Characterization of complex networks: A survey of measurements, Adv. Phys. 56 (2007) 167-242. (Pubitemid 46504905)
3. M. Dehmer, Information processing in complex networks: Graph entropy and information functionals, Appl. Math. Comput. 201 (2008) 82-94.
4. R. Halin, Graphentheorie, Akademie Verlag, Berlin, 1989.
5. M. E. J. Newman, A. L. Barabási, D. J. Watts, The Structure and Dynamics of Networks, Princeton Univ. Press, New Jersey, 2006.
6. V. A. Skorobogatov, A. A. Dobrynin, Metrical analysis of graphs, MATCH Commun. Math. Comp. Chem. 23 (1988) 105-155.
7. F. Emmert-Streib, M. Dehmer, Networks for systems biology: Conceptual connection of data and function, IET Syst. Biol. 5 (2011) 185-207.
8. H. Hirata, R. E. Ulanowicz, Information theoretical analysis of ecological networks, Int. J. Syst. Sci. 15 (1984) 261-270. (Pubitemid 14566415)
9. E. Sommerfeld, F. Sobik, Operations on cognitive structures - their modeling on the basis of graph theory, in: D. Albert (Ed.), Knowledge Structures, Springer, Berlin, 1994, pp. 146-190.
10. M. Dehmer, K. Varmuza, S. Borgert, F. Emmert-Streib, On entropy-based molecular descriptors: Statistical analysis of real and synthetic chemical structures, J. Chem. Inf. Model. 49 (2009) 1655-1663.
11. A. Mowshowitz, Entropy and the complexity of the graphs I: An index of the relative complexity of a graph, Bull. Math. Biophys. 30 (1968) 175-204.
12. J. Körner, Coding of an information source having ambiguous alphabet and the entropy of graphs, Transactions of the 6-th Prague Conference on Information Theory (1973) 411-425.
13. C. Shannon, W. Weaver, The Mathematical Theory of Communication, Univ. Illinois Press, Chicago, 1949.
14. J. Aczél, Z. Daróczy, On Measures of Information and Their Characterizations, Academic Press, New York, 1975.
15. C. Arndt, Information Measures, Springer, Berlin, 2004.
16. Z. Daròczy, A. Jarai, On the measurable solutions of functional equation arising in information theory, Acta Math. Acad. Sci. Hung. 34 (1979) 105-116.
17. P. Rényi, On measures of information and entropy, in: Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability, Univ. California Press, Berkeley, 1961, pp. 547-561.
18. R. K. Tuteja, S. Chaudhary, Order α - β weighted information energy, Inf. Sci. 66 (1992) 53-61.
19. M. Dehmer, N. Barbarini, K. Varmuza, A. Graber, A large scale analysis of information-theoretic network complexity measures using chemical structures, PLoS ONE 4 (2009) e8057.
20. M. V. Diudea, A. Ilić, K. Varmuza, M. Dehmer, Network analysis using a novel highly discriminating topological index, Complexity 16 (2011) 32-39.
21. D. Bonchev, V. Kamenska, C. Tashkova, Equations for the elements in the periodic table based on information theory, MATCH Commun. Math. Comput. Chem. 2 (1976) 117-122.
22. D. Dimov, D. Bonchev, Spin - information equations of the groups and periods in the periodic table of chemical elements, MATCH Commun. Math. Comput. Chem. 2 (1976) 111-115.
23. M. Dehmer, A. Mowshowitz, A history of graph entropy measures, Inf. Sci. 1 (2011) 57-78.
24. B. Zhou, Bounds on the Balaban index, Croat. Chem. Acta 81 (2008) 319-323.
25. B. Zhou, The (n, n)-graphs with the first three extremal Wiener indices, J. Math. Chem. 43 (2008) 60-74.
26. H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc. 69 (1947) 17-20.
27. X. Li, I. Gutman, Mathematical Aspects of Randić-Type Molecular Structure Descriptors, Univ. Kragujevac, Kragujevac, 2006.
28. M. Randić, On characterization of molecular branching, J. Amer. Chem. Soc. 97 (1975) 6609-6615.
29. Y. Shi, Entropy lower bounds for quantum decision tree complexity, Inf. Process. Lett. 81 (2002) 23-27. (Pubitemid 33018982)
30. S. Dragomir, C. Goh, Some bounds on entropy measures in information theory, Appl. Math. Lett. 10 (1997) 23-28. (Pubitemid 127378737)
31. G. H. Hardy, J. E. Littlewood, G. Pólya, Inequalities, Cambridge Univ. Press, Cambridge, 1988.
32. M. Dehmer, A. Mowshowitz, Inequalities for entropy-based measures of network information content, Appl. Math. Comput. 215 (2010) 4263-4271.
33. M. Diudea, G. Katona, Molecular topology of dendrimers, Adv. Dendritic Macromol. 4 (1999) 135-201.
34. A. Marshall, I. Olkin, B. Arnold, Inequalities: Theory of Majorization and Its Applications, Springer, New York, 2011.
35. T. M. Cover, J. A. Thomas, Elements of Information Theory, Wiley, New York, 2006.
36. D. Bonchev, N. Trinajstić, Information theory, distance matrix and molecular branching, J. Chem. Phys. 67 (1977) 4517-4533.
37. M. Dehmer, L. Sivakumar, K. Varmuza, Uniquely discriminating molecular structures using novel eigenvalue-based descriptors, MATCH Commun. Math. Comput. Chem. 67 (2012) 147-172.
38. L. Yuan, H. Kesavan, Minimum entropy and information measure, IEEE Trans. Syst. Man Cybern.-Part C: Appl. Rev. 28 (1998) 488-491. (Pubitemid 128748649)
39. H. Heuser, Lehrbuch der Analysis - Teil 2, Teubner, Stuttgart, 2000.