On Sombor index of trees

Kinkar Chandra Das; Ivan Gutman

doi:10.1016/j.amc.2021.126575

On Sombor index of trees

Kinkar Chandra Das
, Ivan Gutman

Department of Mathematics

University of Kragujevac

Research output: Contribution to journal › Article › peer-review

57 Scopus citations

Abstract

This paper is concerned with the recently introduced Sombor index SO, defined as SO=SO(G)=∑v_kv_ℓ∈E(G)d_G(v_k)²+d_G(v_ℓ)²,where d_G(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.

Original language	English
Article number	126575
Journal	Applied Mathematics and Computation
Volume	412
DOIs	https://doi.org/10.1016/j.amc.2021.126575
State	Published - Jan 2022

Keywords

Independence number
Majorization
Quasi-tree
Sombor index
Tree

Access to Document

10.1016/j.amc.2021.126575

Cite this

@article{e46d829e5bfe4c8ea72cacc34515c109,

title = "On Sombor index of trees",

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.",

keywords = "Independence number, Majorization, Quasi-tree, Sombor index, Tree",

author = "Das, \{Kinkar Chandra\} and Ivan Gutman",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier Inc.",

year = "2022",

month = jan,

doi = "10.1016/j.amc.2021.126575",

language = "English",

volume = "412",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - On Sombor index of trees

AU - Das, Kinkar Chandra

AU - Gutman, Ivan

PY - 2022/1

Y1 - 2022/1

N2 - 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.

AB - 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.

KW - Independence number

KW - Majorization

KW - Quasi-tree

KW - Sombor index

KW - Tree

UR - https://www.scopus.com/pages/publications/85112531506

U2 - 10.1016/j.amc.2021.126575

DO - 10.1016/j.amc.2021.126575

M3 - Article

AN - SCOPUS:85112531506

SN - 0096-3003

VL - 412

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

M1 - 126575

ER -

On Sombor index of trees

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this