A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular plane tessellations, composed of the same kind of regular polygons namely triangular, square, and hexagonal. Using edge congestion-sum problem, we devise a method to compute the Wiener index and demonstrate th...

In this paper we study lower bounds in a unified way for large family of topological indices, including the first variable Zagreb index M 1 ? . Our aim is to obtain sharp inequalities and characterize corresponding extremal graphs. The main results provide several vertex-degree-based indices. These are new even Zagreb, inverse forgotten

The adjacent eccentric distance sum index of a graph G is defined as ξsv(G) = ∑ v∈V (G) ε(v)D(v) deg(v) , where ε(v), deg(v) denote the eccentricity, the degree of the vertex v, respectively, and D(v) = ∑ u∈V (G) d(u, v) is the sum of all distances from the vertex v. In this paper we derive some upper or lower bounds for the adjacent eccentric distance sum in terms of some graph invariants or t...

this paper presents a hybrid technique for simultaneous estimation of parameter and function in inverse heat conduction problems. no prior information is used for the functional form of the heat flux in the present study. the scheme presented here is a combination of two different classical methods: the variable metric method (vmm) and gauss method (gm). the determination of the unknown thermal...