Let\(G\) be a graph with vertex set\(V (G)\) and edge set\(E (G)\). Let\(d_i\) be the degree of
the vertex\(v_i\in V (G)\). The first and second Zagreb indices,\(M_1=\sum_ {v_i\in V (G)} d_i …

For any real number α, the sum of the α-th powers of the degrees of a (molecular) graph G,
denoted by 0Rα (G), is known as the general zeroth–order Randic index as well as the …

The general Randic index Rα (G) of a (chemical) graph G, is defined as the sum of the
weights (d (u) d (v)) α of all edges uv of G, where d (u) denotes the degree of a vertex u in G …

For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the
degrees of vertices, and the second Zagreb index M 2 is equal to the sum of the products of …

The study of the maximum and minimal characteristics of graphs is the focus of the
significant field of mathematics known as extreme graph theory. Finding the biggest or …

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of the squares of the
degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products …

Zagreb Indices: Bounds and Extremal Graphs Page 1 MCM 19 I. Gutman, B. Furtula, KC Das,
E. Milovanovic, I. Milovanovic (Eds.), Bounds in Chemical Graph Theory – Basics, Univ …

In this paper it is shown that the unique graph obtained from the star Sn by adding γ edges
between a fixed pendant vertex v and γ other pendant vertices, has the maximum (minimum) …

In this paper, the effects on the first general Zagreb index are observed when some
operations, such as edge moving, edge separating and edge switching are applied to the …

In this paper the problem of maximizing vertex-degree function index H f (G) for trees and
unicyclic graphs G of order n and independence number s is solved for strictly convex …