TY - JOUR
T1 - Sombor characteristic values of cographs
AU - Raza, Zahid
AU - Rather, Bilal Ahmad
AU - Imran, Muhammad
N1 - Publisher Copyright:
© 2024 The Author(s)
PY - 2024/10/15
Y1 - 2024/10/15
N2 - A unique class of cograph is examined, that is defined recursively as C=C(n1)=K‾n1, and C=C(n1,n2,…,ni)=C(n1,n2,…,ni−1)∪Kni‾, for 2≤i≤k. The Sombor spectrum of C is calculated, the Sombor spectral radius and establish the sharp bounds for the Sombor index, and the greatest and smallest Sombor characteristic values. We present results on the Sombor energy of cographs and identify the graphs that reach the inequalities. Also, we characterize cographs with simple Sombor characteristic values and cographs with unique characteristic values.
AB - A unique class of cograph is examined, that is defined recursively as C=C(n1)=K‾n1, and C=C(n1,n2,…,ni)=C(n1,n2,…,ni−1)∪Kni‾, for 2≤i≤k. The Sombor spectrum of C is calculated, the Sombor spectral radius and establish the sharp bounds for the Sombor index, and the greatest and smallest Sombor characteristic values. We present results on the Sombor energy of cographs and identify the graphs that reach the inequalities. Also, we characterize cographs with simple Sombor characteristic values and cographs with unique characteristic values.
KW - Characteristic values
KW - Cographs graphs
KW - Sombor index
KW - Sombor matrix
UR - https://www.scopus.com/pages/publications/85205371575
UR - https://www.scopus.com/pages/publications/85205371575#tab=citedBy
U2 - 10.1016/j.heliyon.2024.e38578
DO - 10.1016/j.heliyon.2024.e38578
M3 - Article
AN - SCOPUS:85205371575
SN - 2405-8440
VL - 10
JO - Heliyon
JF - Heliyon
IS - 19
M1 - e38578
ER -