On Sombor index of trees

Kinkar Chandra Das and Ivan Gutman

Applied Mathematics and Computation, 2022, vol. 412, issue C

Abstract: This paper is concerned with the recently introduced Sombor index SO, defined asSO=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.

Keywords: Tree; Sombor index; Quasi-tree; Majorization; Independence number (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321006597
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:412:y:2022:i:c:s0096300321006597

DOI: 10.1016/j.amc.2021.126575

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 ().