The rst Zagreb index of a graph is equal to the sum of the square of the vertex degrees of the graph and the forgotten topological index (Findex) of a graph is de ned as the sum of cubes of the vertex degrees of the graph. These parameters have applications in chemistry and drug structures. For any xed integer d ≥ 2, the d-ary tree is a rooted tree in which each node has no more than d children...

The reformulated Zagreb indices of a graph is obtained from the classical Zagreb by replacing vertex degree by edge degree and are defined as sum of squares of the degree of the edges and sum of product of the degrees of the adjacent edges. In this paper we give some explicit results for calculating the first and second reformulated Zagreb indices of dendrimers. Mathematics Subject Classificati...

Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations.

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.

The aim of this paper is using the majorization technique to identify the classes of trees with extermal (minimal or maximal) value of some topological indices, among all trees of order n ≥ 12

The coprime graph of a group G is Γ_G with its set vertices and any two distinct are adjacent if only their order relatively prime. Let p be prime number, then G_p denotes the multiplicative 2×2 upper unitriangular matrices over ring integers modulo p. purposes this research to study Γ_(G_p ) find first second Zagreb eccentricity indices for p≥3. results as follows. First index )isE_1 (Γ_(G_p )...