Extremal unicyclic graphs of Sombor index

Meng Chen and Yan Zhu

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

Abstract: Unicyclic graph is one kind of typical graph for indices basing degree of vertex. Various chemical structures can be exhibited in unicyclic graph as well. A graph is said to be unicyclic if the graph is connected and |V(G)|=|E(G)|. Recently, the Sombor index, which is defined bySO=SO(G)=∑uv∈E(G)dG2(u)+dG2(v), was proposed by Gutman. This paper establishes distinct bounds for this index of unicyclic graph with girth l, as well as specific bounds of chemical unicyclic graph with girth l.

Keywords: Unicyclic graph; The Sombor index; Chemical graph; Extremal value; Girth (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

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

DOI: 10.1016/j.amc.2023.128374

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