The multiplicative Zagreb indices of graph operations

Journal of Chemistry, 2019

Mathematical modeling with the help of numerical coding of graphs has been used in the different fields of science, especially in chemistry for the studies of the molecular structures. It also plays a vital role in the study of the quantitative structure activities relationship (QSAR) and quantitative structure properties relationship (QSPR) models. Todeshine et al. (2010) and Eliasi et al. (2012) defined two different versions of the 1st multiplicative Zagreb index as ∏Γ=∏p∈VΓdΓp2 and ∏1Γ=∏pq∈EΓdΓp+dΓq, respectively. In the same paper of Todeshine, they also defined the 2nd multiplicative Zagreb index as ∏2Γ=∏pq∈EΓdΓp×dΓq. Recently, Liu et al. [IEEE Access; 7(2019); 105479–-105488] defined the generalized subdivision-related operations of graphs and obtained the generalized F-sum graphs using these operations. They also computed the first and second Zagreb indices of the newly defined generalized F-sum graphs. In this paper, we extend this study and compute the upper bonds of the f...

Mathematics, 2015

The reformulated Zagreb indices of a graph are obtained from the classical Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of the end vertices of the edge minus 2. In this paper, we study the behavior of the reformulated first Zagreb index and apply our results to different chemically interesting molecular graphs and nano-structures.

International Journal of Combinatorics, 2012

The first and second Zagreb indices were first introduced by Gutman and Trinajstić (1972). It is reported that these indices are useful in the study of anti-inflammatory activities of certain chemical instances, and in elsewhere. Recently, the first and second Zagreb coindices, a new pair of invariants, were introduced in Došlić (2008). In this paper we introduce the and ()-analogs of the above Zagreb indices and coindices and investigate the relationship between the enhanced versions to get a unified theory.

Bulletin of Mathematical Sciences and Applications, 2016

The modified second multiplicative Zagreb index of a connected graph G, denoted by $\prod_{2}^{*}(G)$, is defined as $\prod_{2}^{*}(G)=\prod \limits_{uv\in E(G)}[d_{G}(u)+d_{G}(v)]^{[d_{G}(u)+d_{G}(v)]}$ where $d_{G}(z)$ is the degree of a vertex z in G. In this paper, we present some upper bounds for the modified second multiplicative Zagreb index of graph operations such as union, join, Cartesian product, composition and corona product of graphs are derived.The modified second multiplicative Zagreb index of aconnected graph , denoted by , is defined as where is the degree of avertex in . In this paper, we present some upper bounds for themodified second multiplicative Zagreb index of graph operations such as union,join, Cartesian product, composition and corona product of graphs are derived.

Journal of Chemistry, 2021

Topological indices (TIs) are expressed by constant real numbers that reveal the structure of the graphs in QSAR/QSPR investigation. The reformulated second Zagreb index (RSZI) is such a novel TI having good correlations with various physical attributes, chemical reactivities, or biological activities/properties. The RSZI is defined as the sum of products of edge degrees of the adjacent edges, where the edge degree of an edge is taken to be the sum of vertex degrees of two end vertices of that edge with minus 2. In this study, the behaviour of RSZI under graph operations containing Cartesian product, join, composition, and corona product of two graphs has been established. We have also applied these results to compute RSZI for some important classes of molecular graphs and nanostructures.

   , where d G (v) is the degree of the vertex v. In this paper we compute these indices for link and splice of graphs. In continuation, with use these graph operations, we compute the first and the second multiplicative Zagreb indices for a class of dendrimers.

Applied Mathematics and Nonlinear Sciences

For a (molecular) graph, the first Zagreb index is equal to the sum of squares of the degrees of vertices, and the F-index is equal to the sum of cubes of the degrees of vertices. In this paper, we introduce sixty four new operations on graphs and study the first Zagreb index and F-index of the resulting graphs.

Ural Mathematical Journal

The first and second Zagreb indices, since its inception have been subjected to an extensive research in the physio- chemical analysis of compounds. In [6] Hanyuan Deng et.al computed the first and second Zagreb indices of four new operations on a graph defined by M. Eliasi, B. Taeri in [4]. Motivated from this we define a new operation on graphs and compute the first and second Zagreb indices of the resultant graph. We illustrate the results with some examples.

Journal of Mathematics

Topological indices are graph-theoretic parameters which are widely used in the subject of chemistry and computer science to predict the various chemical and structural properties of the graphs respectively. Let G be a graph; then, by performing subdivision-related operations S , Q , R , and T on G , the four new graphs S G (subdivision graph), Q G (edge-semitotal), R G (vertex-semitotal), and T G (total graph) are obtained, respectively. Furthermore, for two simple connected graphs G and H , we define F -sum graphs (denoted by G + F H ) which are obtained by Cartesian product of F G and H , where F ∈ S , R , Q , T . In this study, we determine first general Zagreb co-index of graphs under operations in the form of Zagreb indices and co-indices of their basic graphs.

IEEE Access, 2020

Multiplicative Zagreb indices have been studied due to their extensive applications. They play a substantial role in chemistry, pharmaceutical sciences, materials science and engineering, because we can correlate them with numerous physico-chemical properties of molecules. We use graph theory to characterize these chemical structures. The vertices of graphs represent the atoms of a compound and edges of graphs represent the chemical bonds. We present upper and lower bounds on the general multiplicative Zagreb indices for graphs with given number of vertices and cut-edges called bridges. We give all the extremal graphs, which implies that our bounds are best possible.