Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/12554
Title: Sombor index of chemical graphs
Authors: Cruz R.
Gutman I.
Rada, Juan
Journal: Applied Mathematics and Computation
Issue Date: 15-Jun-2021
Abstract: © 2021 Elsevier Inc. 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 as SO(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.
URI: https://scidar.kg.ac.rs/handle/123456789/12554
Type: journal article
DOI: 10.1016/j.amc.2021.126018
ISSN: 00963003
SCOPUS: 85100382910
Appears in Collections:University Library, Kragujevac

Page views(s)

72

Downloads(s)

5

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.