2000 character limit reached
Extremal cacti with respect to Sombor index
Published 14 Mar 2021 in math.CO | (2103.07924v2)
Abstract: Recently, a novel topological index, Sombor index, was introduced by Gutman, defined as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}{2}+d_{v}{2}}$, where $d_{u}$ denotes the degree of vertex $u$. In this paper, we first determine the maximum Sombor index among cacti with $n$ vertices and $t$ cycles, then determine the maximum Sombor index among cacti with perfect matchings. We also characterize corresponding maximum cacti.
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.