The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.

A topological index, which is a number, connected to graph. It often used in chemometrics, biomedicine, and bioinformatics anticipate various physicochemical properties biological activities of compounds. The purpose this article encourage original research focused on graph indices for the drugs azacitidine, decitabine, guadecitabine as well an investigation genesis symmetry actual networks. Sy...

wiener index is a topological index based on distance between every pair of vertices in agraph g. it was introduced in 1947 by one of the pioneer of this area e.g, harold wiener. inthe present paper, by using a new method introduced by klavžar we compute the wiener andszeged indices of some nanostar dendrimers.

For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as M1(G) = ∑ v∈V (G) dG(v) 2 where dG(v) is the degree of vertex v in G. The alternative expression for M1(G) is ∑ uv∈E(G)(dG(u)+dG(v)). Very recently, Eliasi, Iranmanesh and Gutman [7] introduced a new graphical invariant ∏∗ 1(G) = ∏ uv∈E(G)(dG(u) + dG(v)) as the multiplicative version of ...

For a nontrivial graph G, its first Zagreb coindex is defined as the sum of degree sum over all non-adjacent vertex pairs in G and the second Zagreb coindex is defined as the sum of degree product over all non-adjacent vertex pairs in G. Till now, established results concerning Zagreb coindices are mainly related to composite graphs and extremal values of some special graphs. The existing liter...

zagreb indices belong to better known and better researched topological indices. weinvestigate here their ability to discriminate among benzenoid graphs and arrive at some quiteunexpected conclusions. along the way we establish tight (and sometimes sharp) lower andupper bounds on various classes of benzenoids.

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M2 is equal to the sum of products of degrees of pairs of adjacent vertices. In this paper, we investigate Zagreb indices of bicyclic graphs with a given matching number. Sharp upper bounds for the first and second Zagreb indices of bicyclic graphs in terms of the...

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M2 is equal to the sum of products of degrees of pairs of adjacent vertices. In this paper, we study the Zagreb indices of n-vertex connected graphs with k cut vertices, the upper bound for M1and M2-values of n-vertex connected graphs with k cut vertices are deter...

For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...