Sombor Index of Polymers
Abstract
Let G=(V,E) be a finite simple graph. The Sombor index SO(G) of G is defined as Σuv∈ E(G)du2+dv2, where du is the degree of vertex u in G. Let G be a connected graph constructed from pairwise disjoint connected graphs G1,… ,Gk by selecting a vertex of G1, a vertex of G2, 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 G1,...,Gk. In this paper, we consider some particular cases of these graphs that are of importance in chemistry and study their Sombor index.
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.