%0 Journal Article
%T Extremal Trees for Sombor Index with Given Degree Sequence
%J Iranian Journal of Mathematical Chemistry
%I University of Kashan
%Z 2228-6489
%A Movahedi, Fateme
%D 2022
%\ 12/01/2022
%V 13
%N 4
%P 281-290
%! Extremal Trees for Sombor Index with Given Degree Sequence
%K Sombor index
%K extremal tree
%K degree sequence
%R 10.22052/ijmc.2022.248570.1676
%X 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.
%U https://ijmc.kashanu.ac.ir/article_112909_71e766ebb722b78d0a27125112460352.pdf