English

Sombor Index of Polymers

Combinatorics 2021-03-26 v1

Abstract

Let G=(V,E)G=(V,E) be a finite simple graph. The Sombor index SO(G)SO(G) of GG is defined as uvE(G)du2+dv2\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}, where dud_u is the degree of vertex uu in GG. Let GG be a connected graph constructed from pairwise disjoint connected graphs G1,,GkG_1,\ldots ,G_k by selecting a vertex of G1G_1, a vertex of G2G_2, and identifying these two vertices. Then continue in this manner inductively. We say that GG is a polymer graph, obtained by point-attaching from monomer units G1,...,GkG_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.

Keywords

Cite

@article{arxiv.2103.13663,
  title  = {Sombor Index of Polymers},
  author = {Saeid Alikhani and Nima Ghanbari},
  journal= {arXiv preprint arXiv:2103.13663},
  year   = {2021}
}

Comments

14 pages, 16 figures. arXiv admin note: text overlap with arXiv:1607.07084; text overlap with arXiv:1212.3179 by other authors