University of KashanIranian Journal of Mathematical Chemistry2228-648913420221201Extremal Trees for Sombor Index with Given Degree Sequence28129011290910.22052/ijmc.2022.248570.1676ENFatemeMovahediDepartment of Mathematics, Faculty of Sciences, Golestan University, Gorgan, Iran0000-0001-7863-7915Journal Article20221118Let 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)= ∑<sub>uv∈E </sub>√(d(u)<sup>2</sup>+d(v)<sup>2</sup>), 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.https://ijmc.kashanu.ac.ir/article_112909_71e766ebb722b78d0a27125112460352.pdf