Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 175769, 3 pages
http://dx.doi.org/10.1155/2013/175769
Research Article

New Inequalities between Information Measures of Network Information Content

Computer Science Department, Faculty of Automatic Control and Computers, University Politehnica of Bucharest, Splaiul Independentei 313, Bucharest 060042, Romania

Received 12 December 2012; Accepted 28 January 2013

Academic Editor: Carlo Cattani

Copyright © 2013 Pantelimon-George Popescu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Ash, Information Theory, Interscience, New York, NY, USA, 1965. View at MathSciNet
  2. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 2006. View at MathSciNet
  3. F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, 1990. View at MathSciNet
  4. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, USA, 1969. View at MathSciNet
  5. S. Chen, W. Huang, C. Cattani, and G. Altieri, “Traffic dynamics on complex networks: a survey,” Mathematical Problems in Engineering, vol. 2012, Article ID 732698, 23 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  6. M. Dehmer and A. Mowshowitz, “Inequalities for entropy-based measures of network information content,” Applied Mathematics and Computation, vol. 215, no. 12, pp. 4263–4271, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. M. Dehmer, “Information processing in complex networks: graph entropy and information functionals,” Applied Mathematics and Computation, vol. 201, no. 1-2, pp. 82–94, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet