A connected graph G is said to be a cactus if any two cycles have at most one vertex in common. The multiplicative sum Zagreb index of the product degrees adjacent vertices G. In this paper, we introduce several transformations that are useful tools for study extremal properties index. Using these and symmetric structural representations some graphs, determine graphs having maximal with prescri...

This chapter deals with computation of viscosity of 35 alcohols at 20C with the computational tools Multi-linear Regression (MLR) and Associative Neural Network(ASNN) . The four descriptors are used which are variable Zagreb index, Number of Hydroxyl Groups(NOH), Molecular Weight (MW) and Number of Carbon atoms (Nc). MLR is used to optimize the parameter(λ) in the variable Zagreb index by minim...

a topological index of a molecular graph g is a numeric quantity related to g which isinvariant under symmetry properties of g. in this paper we obtain the randić, geometricarithmetic,first and second zagreb indices , first and second zagreb coindices of tensorproduct of two graphs and then the harary, schultz and modified schultz indices of tensorproduct of a graph g with complete graph of ord...

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.