General sum-connectivity index and general Randic index of trees with given maximum degree

被引：6

作者：

Swartz, Elize ^{[1
]}

Vetrik, Tomas ^{[1
]}

机构：

[1] Univ Free State, Dept Math & Appl Math, Bloemfontein, South Africa

来源：

DISCRETE MATHEMATICS LETTERS | 2023年 / 12卷

基金：

新加坡国家研究基金会;

关键词：

general sum-connectivity index; general Randic index; tree; maximum degree; GRAPHS;

D O I：

10.47443/dml.2023.140

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

For trees with given number of vertices n and maximum degree Delta, we present lower bounds on the general sum-connectivity index chi(a) if a > 0 and 3 <= Delta <= n-1, and an upper bound on the general Randic index R-a if -0.283 <= a < 0 and 3 <= Delta <= [n-1/2]. All the extremal trees for our bounds are given.

引用

页码：181 / 188

页数：8

共 12 条

[1] On the maximum general sum-connectivity index of trees with a fixed order and maximum degree [J].

Ahmed, Shahzad .

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021, 13 (04)

[2]

Ali A, 2019, MATCH-COMMUN MATH CO, V81, P249

[3] On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α > 1 [J].

Ali, Akbar ;

Dimitrov, Darko ;

Du, Zhibin ;

Ishfaq, Faiza .

DISCRETE APPLIED MATHEMATICS, 2019, 257 :19-30

[4]

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

[5]

Elumalai S, 2019, DISCRETE MATH LETT, V2, P6

[6]

Jamil MK, 2019, P ROMANIAN ACAD A, V20, P11

[7]

Liu HQ, 2007, MATCH-COMMUN MATH CO, V58, P155

[8] On General Sum-Connectivity Index of Trees of Fixed Maximum Degree and Order [J].

Raza, Zahid ;

Balachandran, Selvaraj ;

Elumalai, Suresh ;

Ali, Akbar .

MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2022, 88 (03) :643-658

[9] SURVEY ON THE GENERAL RANDIC INDEX: EXTREMAL RESULTS AND BOUNDS [J].

Swartz, Elize ;

Vetrik, Tomas .

ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2022, 52 (04) :1177-1203

[10] General Randic index of unicyclic graphs with given number of pendant vertices [J].

Vetrik, Tomas ;

Balachandran, Selvaraj .

DISCRETE MATHEMATICS LETTERS, 2022, 8 :83-88

← 1 2 →