On a novel connectivity index

被引：434

作者：

Zhou, Bo ^{[1
]}

Trinajstic, Nenad ^{[2
]}

机构：

[1] S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China

[2] Rudjer Boskovic Inst, Zagreb 10002, Croatia

来源：

JOURNAL OF MATHEMATICAL CHEMISTRY | 2009年 / 46卷 / 04期

关键词：

Randic connectivity index; Sum-connectivity index; Product-connectivity index; Zagreb indices; Molecular graphs; Lower and upper bounds; CHEMICAL GRAPH-THEORY; ZAGREB INDEXES; MOLECULAR CONNECTIVITY; EXTREMAL GRAPHS; RANDIC INDEX; HYDROCARBONS; DESCRIPTORS; ORBITALS; WEIGHTS; SQUARES;

D O I：

10.1007/s10910-008-9515-z

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

We present a novel connectivity index for (molecular) graphs, called sum-connectivity index and give several basic properties for this index, especially lower and upper bounds in terms of graph (structural) invariants. It appears that this and the original RandiA double dagger connectivity index that we call product-connectivity index are highly intercorrelated molecular descriptors, the value of the correlation coefficient being 0.991 for trees representing lower alkanes. We determine the unique tree with fixed numbers of vertices and pendant vertices with the minimum value of the sum-connectivity index, and trees with the minimum, second minimum and third minimum, and the maximum, second maximum and third maximum values of this index. Additionally, we discuss the properties of this novel connectivity index for a class of trees representing acyclic hydrocarbons.

引用

页码：1252 / 1270

页数：19

共 54 条

[1] The vertex-connectivity index revisited [J].

Amic, D ;

Beslo, D ;

Lucic, B ;

Nikolic, S ;

Trinajstic, N .

JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1998, 38 (05) :819-822

[2]

BALABAN AT, 1983, TOP CURR CHEM, V114, P21

[3]

Basak S.C., 1999, TOPOLOGICAL INDICES, P675

[4]

Basak SC, 1997, CHEM TOPOLOGY 3 DIME, P73

[5] Extremal graphs for weights [J].

Bollobás, B ;

Erdos, P ;

Sarkar, A .

DISCRETE MATHEMATICS, 1999, 200 (1-3) :5-19

[6]

Bollobás B, 1998, ARS COMBINATORIA, V50, P225

[7] Overall connectivity - a next generation molecular connectivity [J].

Bonchev, D .

JOURNAL OF MOLECULAR GRAPHICS & MODELLING, 2001, 20 (01) :65-75

[8] Graphs with maximum connectivity index [J].

Caporossi, G ;

Gutman, I ;

Hansen, P ;

Pavlovic, L .

COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2003, 27 (01) :85-90

[9]

Das KC, 2004, MATCH-COMMUN MATH CO, P103

[10] Maximizing the sum of the squares of the degrees of a graph [J].

Das, KC .

DISCRETE MATHEMATICS, 2004, 285 (1-3) :57-66

← 1 2 3 4 5 6 →