Sharp Lower Bounds of the Sum-Connectivity Index of Unicyclic Graphs

Maryam Atapour and Ali Ahmad

Journal of Mathematics, 2021, vol. 2021, 1-6

Abstract: The sum-connectivity index of a graph G is defined as the sum of weights 1/du+dv over all edges uv of G, where du and dv are the degrees of the vertices u and v in graph G, respectively. In this paper, we give a sharp lower bound on the sum-connectivity index unicyclic graphs of order n≥7 and diameter DG≥5.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/8391480.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/8391480.xml (application/xml)

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:hin:jjmath:8391480

DOI: 10.1155/2021/8391480

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().