@article {
author = {Movahedi, Fateme},
title = {Extremal Trees for Sombor Index with Given Degree Sequence},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {13},
number = {4},
pages = {281-290},
year = {2022},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2022.248570.1676},
abstract = {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.},
keywords = {Sombor index,extremal tree,degree sequence},
url = {https://ijmc.kashanu.ac.ir/article_112909.html},
eprint = {https://ijmc.kashanu.ac.ir/article_112909_71e766ebb722b78d0a27125112460352.pdf}
}