extremal trees for sombor index with given degree sequence

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.