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

Abstract: Let

d_{G} (v)

be the degree of the vertex

v

in a graph

G

. The Sombor index of

G

is defined as

S O (G) = s u m_{u v i n E (G)} s q r t d_{G}^{2} (u) + d_{G}^{2} (v)

, which is a new degree-based topological index introduced by Gutman. Let

m a t h s c r T_{n, D e l t a}

and

m a t h s c r U_{n, D e l t a}

be the set of trees and unicyclic graphs with

n

vertices and maximum degree

D e l t a

, respectively. In this paper, the tree and the unicyclic graph with minimum Sombor index among

m a t h s c r T_{n, D e l t a}

and

m a t h s c r U_{n, D e l t a}

are characterized.

This page was built for publication: The Sombor index of trees and unicyclic graphs with given maximum degree