Sombor Index of Polymers
Combinatorics
2021-03-26 v1
Abstract
Let be a finite simple graph. The Sombor index of is defined as , where is the degree of vertex in . Let be a connected graph constructed from pairwise disjoint connected graphs by selecting a vertex of , a vertex of , and identifying these two vertices. Then continue in this manner inductively. We say that is a polymer graph, obtained by point-attaching from monomer units . In this paper, we consider some particular cases of these graphs that are of importance in chemistry and study their Sombor index.
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