New Bounds on Zagreb Indices
نویسندگان
چکیده
The Zagreb indices are among the oldest and the most famous topological molecular structure-descriptors. The first Zagreb index is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index is equal to the sum of the products of the degrees of pairs of adjacent vertices of the respective graph. In this paper, we characterize the extremal graphs with maximal, second-maximal, third-maximal, fourth-maximal and minimal, secondminimal, third-minimal Zagreb indices among all Eulerian graphs, and then we give the tight conditions on the Zagreb indices of a graph for the existence of a spanning eulerian subgraph, dominating circuits, spanning circuits, Hamiltonian paths and cycles, respectively. Mathematics subject classification (2010): 05C07, 05C45.
منابع مشابه
Chemical Trees with Extreme Values of Zagreb Indices and Coindices
We give sharp upper bounds on the Zagreb indices and lower bounds on the Zagreb coindices of chemical trees and characterize the case of equality for each of these topological invariants.
متن کاملOn discriminativity of Zagreb indices
Zagreb indices belong to better known and better researched topological indices. We investigate here their ability to discriminate among benzenoid graphs and arrive at some quite unexpected conclusions. Along the way we establish tight (and sometimes sharp) lower and upper bounds on various classes of benzenoids.
متن کاملBounds on First Reformulated Zagreb Index of Graph
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.
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملA note on the first Zagreb index and coindex of graphs
Let $G=(V,E)$, $V={v_1,v_2,ldots,v_n}$, be a simple graph with$n$ vertices, $m$ edges and a sequence of vertex degrees$Delta=d_1ge d_2ge cdots ge d_n=delta$, $d_i=d(v_i)$. Ifvertices $v_i$ and $v_j$ are adjacent in $G$, it is denoted as $isim j$, otherwise, we write $insim j$. The first Zagreb index isvertex-degree-based graph invariant defined as$M_1(G)=sum_{i=1}^nd_i^2$, whereas the first Zag...
متن کاملOn multiplicative Zagreb eccentricity indices
Abstract Analogues to multiplicative Zagreb indices in this paper two new type of eccentricity related topological index are introduced called the first and second multiplicative Zagreb eccentricity indices and is defined as product of squares of the eccentricities of the vertices and product of product of the eccentricities of the adjacent vertices. In this paper we give some upper and lower b...
متن کامل