a recently published paper [t. došlić, this journal 3 (2012) 25-34] considers the zagrebindices of benzenoid systems, and points out their low discriminativity. we show thatanalogous results hold for a variety of vertex-degree-based molecular structure descriptorsthat are being studied in contemporary mathematical chemistry. we also show that theseresults are straightforwardly obtained by using...

In this note, we derive the lower bound on the sum for Wiener index of bipartite graph and its bipartite complement, as well as the lower and upper bounds on this sum for the Randić index and Zagreb indices. We also discuss the quality of these bounds.

The similarity of 608 molecular descriptors (including topological and geometrical indices) is measured using correlation coefficients. The computations are based on a library of 10946 diverse compounds. As a result, the second Zagreb index M2 and mwc, the molecular walk count of length 3, were found and proven to be affine dependent: mwc = 2M2.

In this paper we establish some general multiple Opial-type inequalities involving the Canavati fractional derivatives. In some cases the best possible constants are discussed. 1 Faculty of Civil Engineering, Architecture and Geodesy, University of Split, Split, Croatia. E-mail address: [email protected] 2 Faculty of Textile Technology, University of Zagreb, Zagreb, Croatia. E-mail address:...

A topological index is a characteristic value which represents some structural properties of chemical graph. We study strong double graphs and their generalization to compute Zagreb indices coindices. provide explicit computing formulas along with an algorithm generate verify the results. also find relation between these indices. 3D graphical representation are presented understand dynamics afo...

The first and the second Zagreb indices of a graph G = (V,E) are defined as M1(G) = ∑ u∈V dG(u) 2 and M2(G) = ∑ uv ∈ EdG(u)dG(v), where dG(u) denotes the degree of a vertex u in G. It has recently been conjectured that M1(G)/|V | ≤ M2(G)/|E|. Although some counterexamples have already been found, the question of characterizing graphs for which the inequality holds is left open. We show that thi...

In this paper, we present the various upper and lower bounds for the product version of reciprocal degree distance in terms of other graph inavriants. Finally, we obtain the upper bounds for the product version of reciprocal degree distance of the composition, Cartesian product and double of a graph in terms of other graph invariants including the Harary index and Zagreb indices. .