TY - JOUR
ID - 112909
TI - Extremal Trees for Sombor Index with Given Degree Sequence
JO - Iranian Journal of Mathematical Chemistry
JA - IJMC
LA - en
SN - 2228-6489
AU - Movahedi, Fateme
AD - Department of Mathematics, Faculty of Sciences, Golestan University, Gorgan, Iran
Y1 - 2022
PY - 2022
VL - 13
IS - 4
SP - 281
EP - 290
KW - Sombor index
KW - extremal tree
KW - degree sequence
DO - 10.22052/ijmc.2022.248570.1676
N2 - Let G=(V, E) be a simple graph with vertex set V and edge set E. The Sombor index of the graph G is a degree-based topological index, defined as SO(G)= ∑uv∈E √(d(u)2+d(v)2), in which d(x) is the degree of the vertex x∈V for x=u, v. In this paper, we characterize the extremal trees with given degree sequence that minimizes and maximizes the Sombor index.
UR - https://ijmc.kashanu.ac.ir/article_112909.html
L1 - https://ijmc.kashanu.ac.ir/article_112909_71e766ebb722b78d0a27125112460352.pdf
ER -