TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Open Access Research Article

New bound of entropy with respect to refinement of the inequality of Jensen and application in graph theory

* , ,

* Corresponding author · click or hover a name for details

pp. 2129–2138Vol. 46Issue 7October 2025DOI: 10.47974/JIOS-1877XML
Received:
10 Jul 2024
Published Online:
31 Oct 2025
Article type:
Research Article
Language:
EN
Article no.:
JIOS-1877
Pages:
2129–2138

Abstract

In this article, using the first development of a generalization of the Jensen’s inequality, we give a newly limit for the Shannon entropy with respect to the uniformly convex functions. In other words, we obtained an accurate upper limit for this Entropy. So, it will be presented an example with utilization for structural complexity (SC) study for a computer network (CN) shaped using a connected graph (CG) and applications in probabilities. 

Keywords

Subject Classifications

26A5126B2526D1526D1026D20

References

[1] M. A. Khan, M. Hanif, and Z. A. Khan, “Association of Jensen’s inequality for s-convex function with Csiszar divergence,” J. Inequal. Appl., pp. 1-14, (2019). 
[2] H. Barsam, and A. R Sattarzadeh, “Hermite-Hadamard inequalities for uniformly convex functions and Its Applications in Means”, Miskolc Math. Notes, vol 21, no 2, pp. 621-630, (2020). 
[3] H. Barsam, and Y. Sayyari, “Jensen’s inequality and m-convex functions,” Wavelets linear algebr. (In press).
[4] H. H. Bauschke, and P. L. Combettes, “Convex analysis and monotone operator theory in Hilbert Spaces,” Springer-Verlag (2011). 
[5] T. M. Cover, and J. A. Thomas, “Elements of Information Theory,” John Wiley and Sons, Inc (2006). 
[6] S. S. Dragomir, “A converse result for Jensen’s discrete inequality via Grüss inequality and applications in information theory”, An. Univ. Oradea. Fasc. Mat., vol. 7, pp. 178-189, (1999-2000).
[7] S.S. Dragomir, and C.J. Goh, “Some bounds on entropy measures in Information Theory,” Appl. Math. Lett., vol. 10, no. 3, pp. 23-28, (1997). 
[8] R. K. Pathria, P. Beale, “Statistical Mechanics (Third ed.),” Academic Press (2011). 
[9] M. A. Popescu, E. Slusanschi, V. Iancu and F. Pop, “A new bound in information theory,” Networking in Education and Research Joint Event RENAM 8th Conference, 11-13 Sept. (2014), DOI: 10.1109/RoEduNet-RENAM.2014.6955301.
[10] Y. Sayyari, “An improvement of the upper bound on the entropy of information sources,” Journal of Mathematical Extension, vol. 15, no. 5, pp. 1–12, (2021).
[11] Y. Sayyari, “New refinements of Shannon’s entropy upper bounds”, Journal of Information and Optimization Sciences, vol. 42, no. 8, pp. 1869-1883, (2021). https://doi.org/10.1080/02522667.2021.1966947.
[12] Y. Sayyari, “New entropy bounds via uniformly convex functions,” Chaos, Solitons and Fractals, vol. 141, no. 1, pp. 110360, (2020).
[13] Y. Sayyari, and H. Barsam, “Hermite-Hadamard type inequality for m-convex functions by using a new inequality for differentiable functions”, J. Mahani Math. Res. Cent., vol. 9, no. 2, pp. 55-67, (2020). 
[14] S. Simic, “Jensen’s inequality and new entropy bounds,” Appl. Math. Lett., vol. 22, no. 8, pp. 1262-1265, (2009).

Views: 168Downloads: 56Citations: 0