In this note, we give expressions for the first(second) Zagreb coindex, second Zagreb index(coindex), third Zagreb index and first hyper-Zagreb index of the line graphs of subdivision graphs of 2D-lattice, nanotube and nanotorus of TUC4C8[p, q] and obtain upper bounds for Wiener index and degree-distance index of these graphs. This note continue the program of computing certain topological indi...

let g be a simple connected graph. the first and second zagreb indices have been introducedas  vv(g)(v)2 m1(g) degg and m2(g)  uve(g)degg(u)degg(v) , respectively,where degg v(degg u) is the degree of vertex v (u) . in this paper, we define a newdistance-based named hyperzagreb as e uv e(g) .(v))2 hm(g)     (degg(u)  degg inthis paper, the hyperzagreb index of the cartesian product...

Abstract In this paper, we give various lower and upper bounds for the energy of graphs in terms several topological indices graphs: first general multiplicative Zagreb index, Randić zeroth-order redefined indices, atom-bond connectivity index. Moreover, obtain new certain graph invariants as diameter, girth, algebraic radius.

The Zagreb eccentricity indices are the eccentricity reformulation of the Zagreb indices. Let H be a simple graph. The first Zagreb eccentricity index (E1(H)) is defined to be the summation of squares of the eccentricity of vertices, i.e., E1(H) = ∑u∈V(H) Symmetry 2016, 9, 7; doi: 10.3390/sym9010007 www.mdpi.com/journal/symmetry Article First and Second Zagreb Eccentricity Indices of Thorny Gra...

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

in this paper, the hyper - zagreb index of the cartesian product, composition and corona product of graphs are computed. these corrects some errors in g. h. shirdel et al.[11].