On maximum Zagreb indices of bipartite graphs with a given connectivity

被引：1

作者：

Chen, Hanlin ^{[1
]}

Guo, Qiuzhi ^{[2
]}

机构：

[1] Changsha Univ, Coll Comp Engn & Appl Math, Changsha 410022, Peoples R China

[2] Guangdong Univ Finance, Coll Financial Math & Stat, Guangzhou 510521, Peoples R China

来源：

ASIAN-EUROPEAN JOURNAL OF MATHEMATICS | 2023年 / 16卷 / 03期

关键词：

Zagreb index; multiplicative Zagreb index; bipartite graph; connectivity; SHARP UPPER-BOUNDS; EXTREME VALUES; TOPOLOGICAL INDEXES; MOLECULAR-ORBITALS; UNIFIED APPROACH; CHEMICAL TREES; SUM;

D O I：

10.1142/S1793557123500389

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For a graph, the first (multiplicative) Zagreb index is equal to the sum (product) of squares of the vertex degrees, and the second (multiplicative) Zagreb index is equal to the sum (product) of products of the degrees of a pair of adjacent vertices. In this work, by a unified approach, we determine the extremal values of these Zagreb indices in terms of the (edge) connectivity and characterize the corresponding extremal graphs among all connected bipartite graphs of order n. Our results show that the extremal graphs of given (edge) connectivity regarding the Zagreb indices and multiplicative Zagreb indices do not completely coincide with other topological indices.

引用

页数：18

共 41 条

[1] Aslan S, 2017, 2017 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), P1095, DOI 10.1109/UBMK.2017.8093495
[2] Edge connectivity and the spectral gap of combinatorial and quantum graphs
Berkolaiko, Gregory
Kennedy, James B.
Kurasov, Pavel
Mugnolo, Delio
[J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2017, 50 (36)
[3] Bollobas B., 1998, MODERN GRAPH THEORY
[4] Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs
Bonnet, Edouard
Escoffier, Bruno
Paschos, Vangelis Th.
Stamoulis, Georgios
[J]. DISCRETE OPTIMIZATION, 2018, 27 : 26 - 56
[5] Borovicanin B, 2017, MATCH-COMMUN MATH CO, V78, P17
[6] Bozovic V, 2016, MATCH-COMMUN MATH CO, V76, P207
[7] Extremal bipartite graphs of given connectivity with respect to matching energy
Chen, Hanlin
Deng, Hanyuan
[J]. DISCRETE APPLIED MATHEMATICS, 2018, 239 : 200 - 205
[8] Chen HL, 2017, MATCH-COMMUN MATH CO, V78, P103
[9] The extremal values of some topological indices in bipartite graphs with a given matching number
Chen, Hanlin
Wu, Renfang
Deng, Hanyuan
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2016, 280 : 103 - 109
[10] Extreme values of the sum of squares of degrees of bipartite graphs
Cheng, T. C. Edwin
Guo, Yonglin
Zhang, Shenggui
Du, Yongjun
[J]. DISCRETE MATHEMATICS, 2009, 309 (06) : 1557 - 1564

← 1 2 3 4 5 →