共 50 条
Extremal Graphs for Sombor Index with Given Parameters
被引:2
作者:
Zhang, Wanping
[1
]
Meng, Jixiang
[1
]
Wang, Na
[1
]
机构:
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
来源:
关键词:
chromatic number;
girth;
connectivity;
matching number;
Sombor index;
D O I:
10.3390/axioms12020203
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this paper, we present the upper and lower bounds on Sombor index SO(G) among all connected graphs (respectively, connected bipartite graphs). We give some sharp lower and upper bounds on SO(G) among connected graphs in terms of some parameters, including chromatic, girth and matching number. Meanwhile, we characterize the extremal graphs attaining those bounds. In addition, we give upper bounds on SO(G) among connected bipartite graphs with given matching number and/or connectivity and determine the corresponding extremal connected bipartite graphs.
引用
收藏
页数:13
相关论文
共 50 条