Sombor Index of Polymers

Publication date 26 November 2021

Abstract: Let

G = (V, E)

be a finite simple graph. The Sombor index

S O (G)

of

G

is defined as

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

, where

d_{u}

is the degree of vertex

u

in

G

. Let

G

be a connected graph constructed from pairwise disjoint connected graphs

G_{1}, l d o t s, G_{k}

by selecting a vertex of

G_{1}

, a vertex of

G_{2}

, and identifying these two vertices. Then continue in this manner inductively. We say that

G

is a polymer graph, obtained by point-attaching from monomer units

G_{1}, ..., G_{k}

. In this paper, we consider some particular cases of these graphs that are of importance in chemistry and study their Sombor index.

Recommendations

Cited in

(49)

This page was built for publication: Sombor Index of Polymers