Logical Entropy of Information Sources.

In this paper, we present the concept of the logical entropy of order m, logical mutual information, and the logical entropy for information sources. We found upper and lower bounds for the logical entropy of a random variable by using convex functions. We show that the logical entropy of the joint distributions X1 and X2 is always less than the sum of the logical entropy of the variables X1 and X2. We define the logical Shannon entropy and logical metric permutation entropy to an information system and examine the properties of this kind of entropy. Finally, we examine the amount of the logical metric entropy and permutation logical entropy for maps.

Hosoya Polynomial for Subdivided Caterpillar Graphs.

BACKGROUND: Computing Hosoya polynomial for a graph associated with a chemical compound plays a vital role in the field of chemistry. From Hosoya polynomial, it is easy to compute the Weiner index(Weiner number) and Hyper Weiner index of the underlying molecular structure. The Wiener number enables the identifying of three basic features of molecular topology: branching, cyclicity, and centricity (or centrality) and their specific patterns, which are well reflected by the physicochemical properties of chemical compounds. Caterpillar trees are used in chemical graph theory to represent the structure of benzenoid hydrocarbons molecules. In this representation, one forms a caterpillar in which each edge corresponds to a 6-carbon ring in the molecular structure, and two edges are incident at a vertex whenever the corresponding rings belong to a sequence of rings connected end-to-end in the structure. Due to the importance of Caterpillar trees, it is interesting to compute the Hosoya polynomial and the related indices. METHODS: The Hosoya polynomial of a graph G is defined as H(G;x) = Σd(G)K=0 d(G.k)xk. In order to compute the Hosoya polynomial, we need to find its coefficient d(G.k) which is the number of pairs of vertices of G which are at distance k. We classify the ordered pair of vertices which are at distance , 2 ≤ m ≤ (n + 1)k in the form of sets. Then finding the cardinality of these sets and adding them up will give us the value of coefficient d(G.m) . Finally, using the values of coefficients in the definition, we get the Hosoya polynomial of uniform subdivision of caterpillar graph. RESULT: In this work, we compute the closed formula of Hosoya polynomial for subdivided caterpillar trees. This helps us to compute the Weiner index and hyper-Weiner index of uniform subdivision of caterpillar graph. CONCLUSION: Caterpillar trees are among the important and general classes of trees. Thorn rods and thorn stars are the important subclasses of caterpillar trees. The idea of the present research article is to provide a road map to those researchers who are interested in studying the Hosoya polynomial for different trees.

n-polynomial exponential type p-convex function with some related inequalities and their applications.

In this paper, the idea and its algebraic properties of n-polynomial exponential type p-convex function have been investigated. Authors prove new trapezium type inequality for this new class of functions. We also obtain some refinements of the trapezium type inequality for functions whose first derivative in absolute value at certain power are n-polynomial exponential type p-convex. At the end, some new bounds for special means of different positive real numbers are provided as well. These new results yield us some generalizations of the prior results. Our idea and technique may stimulate further research in different areas of pure and applied sciences.

New generalizations of Popoviciu-type inequalities via new Green's functions and Montgomery identity.

The inequality of Popoviciu, which was improved by Vasic and Stankovic (Math. Balk. 6:281-288, 1976), is generalized by using new identities involving new Green's functions. New generalizations of an improved Popoviciu inequality are obtained by using generalized Montgomery identity along with new Green's functions. As an application, we formulate the monotonicity of linear functionals constructed from the generalized identities, utilizing the recent theory of inequalities for n-convex functions at a point. New upper bounds of Grüss and Ostrowski type are also computed.