Sombor index of chemical graphs

Roberto Cruz, Ivan Gutman and Juan Rada

Applied Mathematics and Computation, 2021, vol. 399, issue C

Abstract: A graph G consists of a set of vertices V(G) and a set of edges E(G). Recently, a new vertex-degree-based molecular structure descriptor was introduced, defined asSO(G)=∑uv∈E(G)(du)2+(dv)2and named “Sombor index”. By du is denoted the degree of the vertex u∈V(G). In this paper we are concerned with the Sombor index of chemical graphs. Recall that G is a chemical graph if du≤4 for all u∈V(G). We characterize the graphs extremal with respect to the Sombor index over the following sets: (connected) chemical graphs, chemical trees, and hexagonal systems.

Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321000667
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:399:y:2021:i:c:s0096300321000667

DOI: 10.1016/j.amc.2021.126018

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().