Abstract
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.
| Original language | English |
|---|---|
| Article number | e38578 |
| Journal | Heliyon |
| Volume | 10 |
| Issue number | 19 |
| DOIs | |
| Publication status | Published - Oct 15 2024 |
| Externally published | Yes |
Keywords
- Characteristic values
- Cographs graphs
- Sombor index
- Sombor matrix
ASJC Scopus subject areas
- General
Fingerprint
Dive into the research topics of 'Sombor characteristic values of cographs'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS