Extremal Sombor Index of Graphs with Cut Edges and Clique Number

被引:0
作者
Wali, Mihrigul [1 ,2 ]
Guji, Raxida [2 ]
机构
[1] Xiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R China
[2] Xinjiang Univ Finance & Econ, Sch Stat & Data Sci, Urumqi 830012, Peoples R China
关键词
Sombor index; cut edge; clique number;
D O I
10.3390/axioms13010066
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The Sombor index is defined as SO(G)= n-ary sumation uv is an element of E(G)d2(u)+d2(v), where d(u) and d(v) represent the number of edges in the graph G connected to the vertices u and v, respectively. In this paper, we characterize the largest and second largest Sombor indexes with a given number of cut edges. Moreover, we determine the upper and lower sharp bounds of the Sombor index with a given number of clique numbers, and we characterize the extremal graphs.
引用
收藏
页数:12
相关论文
共 26 条
[1]  
Alikhani S, 2021, MATCH-COMMUN MATH CO, V86, P715
[2]  
Bondy J., 1976, Graph Theory with Its Applications
[3]   Extremal Values on the Sombor Index of Trees [J].
Chen, Hanlin ;
Li, Wenhao ;
Wang, Jing .
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2022, 87 (01) :23-49
[4]   Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges [J].
Chen, Shubo ;
Liu, Weijun .
GRAPHS AND COMBINATORICS, 2014, 30 (01) :109-118
[5]   Sombor index of trees with at most three branch vertices [J].
Cruz, Roberto ;
Rada, Juan ;
Sigarreta, Jose M. .
APPLIED MATHEMATICS AND COMPUTATION, 2021, 409
[6]   Extremal values of the Sombor index in unicyclic and bicyclic graphs [J].
Cruz, Roberto ;
Rada, Juan .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2021, 59 (04) :1098-1116
[7]   Sombor index of chemical graphs [J].
Cruz, Roberto ;
Gutman, Ivan ;
Rada, Juan .
APPLIED MATHEMATICS AND COMPUTATION, 2021, 399
[8]   On Sombor Index [J].
Das, Kinkar Chandra ;
Cevik, Ahmet Sinan ;
Cangul, Ismail Naci ;
Shang, Yilun .
SYMMETRY-BASEL, 2021, 13 (01) :1-12
[9]  
Erdos P., 1970, MAT LAPOK, V21, P249
[10]  
Gutman I., 2010, NOVEL MOL STRUCTURE