ON THE MULTIPLICATIVE ZAGREB COINDEX OF GRAPHS

被引:41
作者
Xu, Kexiang [1 ]
Das, Kinkar Ch. [2 ]
Tang, Kechao [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing 210016, Jiangsu, Peoples R China
[2] Sungkyunkwan Univ, Dept Math, Suwon 140746, South Korea
关键词
vertex degree; tree; upper or lower bound;
D O I
10.7494/OpMath.2013.33.1.191
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For a (molecular) graph G with vertex set V (G) and edge set E (G) , the first and second Zagreb indices of G are defined as M-1(G) = Sigma upsilon is an element of V(G)d(G)(v())2 and M-2(G) = Sigma(uv)is an element of E(G) d(G)(u)d(G)(v) , respectively, where d G (v) is the degree of vertex v in G . The al-ternative expression of M-1(G) is Sigma E-uv is not an element of(G)(d(G)(u) + d(G)(v)) . Recently Ashrafi, Doslic' and Hamzeh introduced two related graphical invariants (M) over bar (1)(G) = Sigma E-uv is not an element of(G)(dG(u) vertical bar dG(v)) and (M) over bar (2)(G) = Sigma E-uv is not an element of(G)(d(G)(u)d(G)(v)) named as first Zagreb coindex and second Zagreb coindex, respectively. Here we define two new graphical invariants (pi) over bar (1)(G) = pi(uv is an element of E(G))(d(G)(u)d(G)(v)) and (pi) over bar (2)(G) = pi(uv is not an element of E(G))(dG(u)dG(v)) as the respective multiplicative versions of M i for i = 1 , 2 . In this paper, we have reported some properties, especiall y upper and lower bounds, for these two graph invariants of connected (molecular) gra phs. Moreover, some correspond-ing extremal graphs have been characterized with respect to these two indices.
引用
收藏
页码:191 / 204
页数:14
相关论文
共 27 条
[21]  
Todeschini R, 2010, MATCH-COMMUN MATH CO, V64, P359
[22]  
Trinajstic N., 1983, CHEM GRAPH THEORY, V2nd ed.
[23]  
Xu KX, 2012, MATCH-COMMUN MATH CO, V68, P257
[24]  
Xu KX, 2012, MATCH-COMMUN MATH CO, V68, P241
[25]  
Xu KX, 2011, MATCH-COMMUN MATH CO, V66, P795
[26]   The Zagreb indices of graphs with a given clique number [J].
Xu, Kexiang .
APPLIED MATHEMATICS LETTERS, 2011, 24 (06) :1026-1030
[27]   Estimating the Zagreb indices and the spectral radius of triangle- and quadrangle-free connected graphs [J].
Yamaguchi, Seiichi .
CHEMICAL PHYSICS LETTERS, 2008, 458 (4-6) :396-398