Trees with maximum multiplicative connectivity indices

被引：0
|
作者：
Azari, Mahdieh [1 ]
Dehgardi, Nasrin [2 ]
机构：
[1] Islamic Azad Univ, Dept Math, Kazerun Branch, POB 73135-168, Kazerun, Iran
[2] Sirjan Univ Technol, Dept Math & Comp Sci, Sirjan, Iran
来源：
JOURNAL OF INTERDISCIPLINARY MATHEMATICS | 2024年 / 27卷 / 07期
关键词：
Vertex-degree-based topological indices; Maximum degree; Extremal problem; Tree; HARMONIC INDEX; MOLECULAR-ORBITALS; GRAPH-THEORY; SUM; BOUNDS;
D O I：
10.47974/JIM-1862
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The product-connectivity (also called Randi & cacute; connectivity) index, sum-connectivity index and harmonic index are among the best-known and most successful vertex-degreebased topological indices in mathematical chemistry. The multiplicative versions of these graph invariants were proposed by Kulli in 2016. In this paper, we give the maximum values of the multiplicative product-connectivity, multiplicative sum-connectivity and multiplicative harmonic indices within the set of trees with a given order and maximum vertex degree and specify the maximal trees.
引用
收藏
页码：1517 / 1529
页数：13
相关论文
共 50 条
12345