2000 character limit reached
The Sombor index of trees and unicyclic graphs with given maximum degree (2103.07947v1)
Published 14 Mar 2021 in math.CO
Abstract: Let $d_G(v)$ be the degree of the vertex $v$ in a graph $G$. The Sombor index of $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d2_G(u)+d2_G(v)}$, which is a new degree-based topological index introduced by Gutman. Let $\mathscr{T}{n,\Delta}$ and $\mathscr{U}{n,\Delta}$ be the set of trees and unicyclic graphs with $n$ vertices and maximum degree $\Delta$, respectively. In this paper, the tree and the unicyclic graph with minimum Sombor index among $\mathscr{T}{n,\Delta}$ and $\mathscr{U}{n,\Delta}$ are characterized.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.