Open problems on Sombor index of unicyclic and bicyclic graphs

Kinkar Chandra Das

Applied Mathematics and Computation, 2024, vol. 473, issue C

Abstract: Let Γ=(V,E) be a graph of order p. Recently, the Sombor index is introduced, defined asSO(Γ)=∑vivj∈E(Γ)dΓ(vi)2+dΓ(vj)2, where dΓ(vi) is the degree of the vertex vi in Γ. Cruz and Rada [4] obtained an upper bound on the Sombor index of unicyclic and bicyclic graphs of order p, but did not characterize the extremal graphs. In the same paper, they mentioned that the maximal graphs over the set of unicyclic and bicyclic graphs with respect to Sombor index, is an interesting problem that remains open. In this paper we completely solve these problems.

Keywords: Unicyclic graph; Bicyclic graph; Maximum degree; Sombor index (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032400119X
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:473:y:2024:i:c:s009630032400119x

DOI: 10.1016/j.amc.2024.128647

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