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

Abstract

Let dG(v) be the degree of the vertex v in a graph G. The Sombor index of G is defined as SO(G) =Σuv∈ E(G)d2G(u)+d2G(v), which is a new degree-based topological index introduced by Gutman. Let Tn, and Un, be the set of trees and unicyclic graphs with n vertices and maximum degree , respectively. In this paper, the tree and the unicyclic graph with minimum Sombor index among Tn, and Un, are characterized.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…