Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Sombor index of trees and unicyclic graphs with given maximum degree

Published 14 Mar 2021 in math.CO | (2103.07947v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.