Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index

被引：59

作者：

Hu, Yumei ^{[1
]}

Li, Xueliang

Shi, Yongtang

Xu, Tianyi

机构：

[1] Nankai Univ, Ctr Combinator & LPMC, Tianjin 300071, Peoples R China

[2] Tianjin Univ, Dept Math, Tianjin 300072, Peoples R China

来源：

DISCRETE APPLIED MATHEMATICS | 2007年 / 155卷 / 08期

基金：

中国国家自然科学基金;

关键词：

molecular structure descriptor; Zetoth-order general Randic index; extrenial; (n; m)-graph; degree sequence;

D O I：

10.1016/j.dam.2006.11.008

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a graph and d(v) denote the degree of a vertex v in G. Then the zeroth-order general Randic index OR, (G) of the graph G is defined as Sigma(v is an element of V(G))d(v)(alpha), where alpha is a pertinently chosen real number. We characterize, for any alpha, the connected (n, m)-graphs with minimum and maximum R-0(alpha). (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：1044 / 1054

页数：11

共 17 条

[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] Extremal graphs for weights [J].

Bollobás, B ;

Erdos, P ;

Sarkar, A .

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

[3]

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

[4]

Bondy J.A., 2008, GRAD TEXTS MATH

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

Caporossi, G ;

Gutman, I ;

Hansen, P ;

Pavlovic, L .

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

[6]

Hu YM, 2005, MATCH-COMMUN MATH CO, V54, P425

[7]

Hu YM, 2004, MATCH-COMMUN MATH CO, P129

[8]

Hu YM, 2004, MATCH-COMMUN MATH CO, P119

[9]

Kier L. H., 1976, Molecular Connectivity in Chemistry and Drug Research

[10]

KIER LB, 1977, EUR J MED CHEM, V12, P307

← 1 2 →