Sharp lower bounds on the Narumi-Katayama index of graph operations

被引：35

作者：

Azari, Mahdieh ^{[1
]}

机构：

[1] Islamic Azad Univ, Kazerun Branch, Dept Math, Kazerun, Iran

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2014年 / 239卷

关键词：

Degree; Lower bound; Narumi-Katayama index; Graph operations; ZAGREB INDEXES; HIERARCHICAL PRODUCT; SUM; INVARIANTS; RESPECT; ENTROPY; 1ST;

D O I：

10.1016/j.amc.2014.04.088

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The Narumi-Katayama index NK(G) of a simple graph G is equal to the product of the degrees of the vertices of G. In this paper, we present sharp lower bounds on the Narumi-Katayama index of several graph operations such as union, join, suspension, rooted product, cluster, corona product, direct product, Cartesian product, strong product, generalized hierarchical product, composition, disjunctive product and symmetric difference in terms of the Narumi-Katayama indices and the orders of their components. Using these results, the Narumi-Katayama index of several classes of graphs will be computed. (C) 2014 Elsevier Inc. All rights reserved.

引用

页码：409 / 421

页数：13

共 45 条

[1]

Arezoomand M, 2013, MATCH-COMMUN MATH CO, V69, P131

[2]

Azari M, 2012, UTILITAS MATHEMATICA, V87, P151

[3]

Azari M, 2011, ARS COMBINATORIA, V100, P113

[4]

Azari M, 2013, MATCH-COMMUN MATH CO, V70, P901

[5] Computing the eccentric-distance sum for graph operations [J].

Azari, Mandieh ;

Iranmanesh, Ali .

DISCRETE APPLIED MATHEMATICS, 2013, 161 (18) :2827-2840

[6] HIGHLY DISCRIMINATING DISTANCE-BASED TOPOLOGICAL INDEX [J].

BALABAN, AT .

CHEMICAL PHYSICS LETTERS, 1982, 89 (05) :399-404

[7]

Bonchev D., 1983, INFORMATION THEORETI, P1

[8] The multiplicative Zagreb indices of graph operations [J].

Das, Kinkar C. ;

Yurttas, Aysun ;

Togan, Muge ;

Cevik, Ahmet Sinan ;

Cangul, Ismail Naci .

JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013,

[9] Information processing in complex networks: Graph entropy and information functionals [J].

Dehmer, Matthias .

APPLIED MATHEMATICS AND COMPUTATION, 2008, 201 (1-2) :82-94

[10] An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants [J].

Dehmer, Matthias ;

Grabner, Martin ;

Mowshowitz, Abbe ;

Emmert-Streib, Frank .

ADVANCES IN COMPUTATIONAL MATHEMATICS, 2013, 39 (02) :311-325

← 1 2 3 4 5 →