Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/12554
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCruz R.-
dc.contributor.authorGutman, Ivan-
dc.contributor.authorRada, Juan-
dc.date.accessioned2021-04-20T21:07:46Z-
dc.date.available2021-04-20T21:07:46Z-
dc.date.issued2021-
dc.identifier.issn0096-3003-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/12554-
dc.description.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.-
dc.rightsrestrictedAccess-
dc.sourceApplied Mathematics and Computation-
dc.titleSombor index of chemical graphs-
dc.typearticle-
dc.identifier.doi10.1016/j.amc.2021.126018-
dc.identifier.scopus2-s2.0-85100382910-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

99

Downloads(s)

8

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.