Sombor Index of Polymers

By Saeid Alikhani, Nima Ghanbari. 2021

65 citations recorded by the source corpus.

du + d 2 v, 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.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/dfb62270fcab031f6471d271ee011f4f57606cce