Extremal Arithmetic-Geometric Index of Bicyclic Graphs

被引:3
作者
Niu, Baohua [1 ]
Zhou, Shuming [1 ,2 ]
Zhang, Hong [1 ]
机构
[1] Fujian Normal Univ, Coll Math & Stat, Fuzhou 350117, Fujian, Peoples R China
[2] Fujian Normal Univ, Ctr Appl Math Fujian Prov, Fuzhou 350117, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
Arithmetic-geometric index; Bicyclic graph; Extremal values; UNICYCLIC GRAPHS; RADIUS; ENERGY;
D O I
10.1007/s00034-023-02385-4
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recently, a novel topological index of graphs, called arithmetic-geometric ( AG) index, has been proposed to characterize the nature of chemical compounds or interconnection networks. The arithmetic-geometric index of the graph G is denoted as AG(G) = Sigma(xy is an element of E(G)) d(x)+d(y)/2 root dx d(y), where d(x) is the degree of vertex x. Vuki ' cevi ' c et al. (Discrete Appl Math 302:67-75, 2021) determined the n-vertex unicyclic graphs with extremal values of AG index and proposed a conjecture about extremal values of AG index in the class of bicyclic graphs. In this work, we confirm this conjecture and show that if G is an n-vertex connected bicyclic graph, then n - 3+ v(10)/(root 6) <= AG(G) <= (n+2)/(2 root 3(n-1)) + (n+1)/(root 2(n-1)) + (n(n-4))/(2 root n-1) + (5)/(root 6). The left equation holds for the following two types of graphs: the graph consisting of two vertex-disjoint cycles C-a and C-b with n = a + b connected by an edge and the graph derived by adding an edge between two non-adjacent vertices in C-n. The right equation holds for the graph constructed by adding n- 4 pendant vertices to the vertex of degree 3 in C-4(+), where C-4(+) is the bicyclic graph derived from adding an edge between two non-adjacent vertices in C-4. Furthermore, we investigate the correlations of AG index with physico-chemical properties of octane isomers and show that it is a better predictor of molecular properties.
引用
收藏
页码:5739 / 5760
页数:22
相关论文
共 50 条
[31]   Extremal reformulated forgotten index of trees, unicyclic and bicyclic graphs [J].
Sarkar, Ishita ;
Nanjappa, Manjunath ;
Gutman, Ivan .
FILOMAT, 2024, 38 (01) :25-32
[32]   On extremal bipartite bicyclic graphs [J].
Huang, Jing ;
Li, Shuchao ;
Zhao, Qin .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2016, 436 (02) :1242-1255
[33]   PI index of bicyclic graphs [J].
Chithrabhanu, Manju Sankaramalil ;
Somasundaram, Kanagasabapathi .
COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024, 9 (03) :425-436
[34]   Bicyclic graphs with extremal cover cost [J].
Lu, Jian ;
Pan, Xiang-Feng ;
Liu, Huiqing .
APPLIED MATHEMATICS AND COMPUTATION, 2021, 405
[35]   Extremal Degree Distance Of Bicyclic Graphs [J].
Chen, Shubo ;
Liu, Weijun ;
Xia, Fangli .
UTILITAS MATHEMATICA, 2013, 90 :149-169
[36]   Extremal Bicyclic 3-Chromatic Graphs [J].
Ioan Tomescu ;
Sana Javed .
Graphs and Combinatorics, 2015, 31 :1043-1052
[37]   Extremal Bicyclic 3-Chromatic Graphs [J].
Tomescu, Ioan ;
Javed, Sana .
GRAPHS AND COMBINATORICS, 2015, 31 (04) :1043-1052
[38]   Some Mathematical Properties of the Geometric-Arithmetic Index/Coindex of Graphs [J].
Stankov, S. ;
Matejic, M. ;
Milovanovic, I ;
Milovanovic, E. .
FILOMAT, 2021, 35 (15) :5045-5057
[39]   ON THE MODIFIED RANDIC INDEX OF TREES, UNICYCLIC GRAPHS AND BICYCLIC GRAPHS [J].
Li, Jianping ;
Zhou, Bo .
MISKOLC MATHEMATICAL NOTES, 2012, 13 (02) :415-427
[40]   The Wiener index of bicyclic graphs with perfect matchings [J].
Tan, Shangwang .
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2019, 40 (04) :931-956