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.