2022/11/10 by Movahedi, Fateme
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2211.06396
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 a given degree sequence that maximizes the Sombor index.