On multiplicative Zagreb indices of graphs
Authors
Abstract:
Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1 G and ( ) 2 G , under the name first and second multiplicative Zagreb index, respectively. These are define as ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2 G d v d v G uv E G G , where dG(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.
similar resources
Zagreb, multiplicative Zagreb Indices and Coindices of graphs
Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=sum_{uin V} d(u)^2, hspace {.1 cm} M_2(G)=sum_{uvin E} d(u).d(v)$ and $ M_3(G)=sum_{uvin E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second m...
full texton multiplicative zagreb indices of graphs
todeschini et al. have recently suggested to consider multiplicative variants of additive graphinvariants, which applied to the zagreb indices would lead to the multiplicative zagrebindices of a graph g, denoted by ( ) 1 g and ( ) 2 g , under the name first and secondmultiplicative zagreb index, respectively. these are define as ( )21 ( ) ( )v v gg g d vand ( ) ( ) ( )( )2 g d v d v gu...
full textzagreb, multiplicative zagreb indices and coindices of graphs
let g=(v,e) be a simple connected graph with vertex set v and edge set e. the first, second and third zagreb indices of g are respectivly defined by: $m_1(g)=sum_{uin v} d(u)^2, hspace {.1 cm} m_2(g)=sum_{uvin e} d(u).d(v)$ and $ m_3(g)=sum_{uvin e}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in g and uv is an edge of g connecting the vertices u and v. recently, the first and second m...
full textOn multiplicative Zagreb eccentricity indices
Abstract Analogues to multiplicative Zagreb indices in this paper two new type of eccentricity related topological index are introduced called the first and second multiplicative Zagreb eccentricity indices and is defined as product of squares of the eccentricities of the vertices and product of product of the eccentricities of the adjacent vertices. In this paper we give some upper and lower b...
full textMultiplicative Zagreb Indices of Trees
Let G be a graph with vertex set V (G) and edge set E(G) . The first and second multiplicative Zagreb indices of G are Π1 = ∏ x∈V (G) deg(x) 2 and Π2 = ∏ xy∈E(G) deg(x) deg(y) , respectively, where deg(v) is the degree of the vertex v . Let Tn be the set of trees with n vertices. We determine the elements of Tn , extremal w.r.t. Π1 and Π2 . AMS Mathematics Subject Classification (2000): 05C05, ...
full textMultiplicative Zagreb Eccentricity Indices of Some Composite Graphs
Let G be a connected graph. The multiplicative Zagreb eccentricity indices of G are defined respectively as Π1(G) = ∏ v∈V (G) ε 2 G(v) and Π ∗ 2(G) = ∏ uv∈E(G) εG(u)εG(v), where εG(v) is the eccentricity of vertex v in graph G and εG(v) = (εG(v)) . In this paper, we present some bounds of the multiplicative Zagreb eccentricity indices of Cartesian product graphs by means of some invariants of t...
full textMy Resources
Journal title
volume 3 issue 2
pages 145- 154
publication date 2012-09-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023