Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/13466
Full metadata record
DC FieldValueLanguage
dc.rights.licenserestrictedAccess-
dc.contributor.authordas, kinkar-
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2021-09-24T22:41:17Z-
dc.date.available2021-09-24T22:41:17Z-
dc.date.issued2022-
dc.identifier.issn0096-3003-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/13466-
dc.description.abstractThis paper is concerned with the recently introduced Sombor index SO, defined as SO=SO(G)=∑vkvℓ∈E(G)dG(vk)2+dG(vℓ)2,where dG(v) is the degree of the vertex v of a graph G. We present bounds on SO of trees in terms of order, independence number, and number of pendent vertices, and characterize the extremal cases. In addition, analogous results for quasi-trees are established.-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.sourceApplied Mathematics and Computation-
dc.titleOn Sombor index of trees-
dc.typearticle-
dc.identifier.doi10.1016/j.amc.2021.126575-
dc.identifier.scopus2-s2.0-85112531506-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

507

Downloads(s)

26

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.