Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/13466
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | restrictedAccess | - |
dc.contributor.author | das, kinkar | - |
dc.contributor.author | Gutman, Ivan | - |
dc.date.accessioned | 2021-09-24T22:41:17Z | - |
dc.date.available | 2021-09-24T22:41:17Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 0096-3003 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/13466 | - |
dc.description.abstract | This 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.rights | info:eu-repo/semantics/restrictedAccess | - |
dc.source | Applied Mathematics and Computation | - |
dc.title | On Sombor index of trees | - |
dc.type | article | - |
dc.identifier.doi | 10.1016/j.amc.2021.126575 | - |
dc.identifier.scopus | 2-s2.0-85112531506 | - |
Appears in Collections: | Faculty of Science, Kragujevac |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PaperMissing.pdf Restricted Access | 29.86 kB | Adobe PDF | View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.