The Sombor index and coindex of two-trees

Abstract: The Sombor index of a graph

G

, introduced by Ivan Gutman, is defined as the sum of the weights

s q r t d_{G} (u)^{2} + d_{G} (v)^{2}

of all edges

u v

of

G

, where

d_{G} (u)

denotes the degree of vertex

u

in

G

. The Sombor coindex is recently defined as

. In this paper, the maximum and second maximum Sombor index, the minimum and second minimum Sombor coindex in two-trees are determined.

This page was built for publication: The Sombor index and coindex of two-trees