Extremal Values of Randić Index among Some Classes of Graphs

Ali Ghalavand, Ali Reza Ashrafi and Marzieh Pourbabaee

Mathematical Problems in Engineering, 2021, vol. 2021, 1-11

Abstract:

Suppose is a simple graph with edge set . The Randić index is defined as , where and denote the vertex degrees of and in , respectively. In this paper, the first and second maximum of Randić index among all vertex cyclic graphs was computed. As a consequence, it is proved that the Randić index attains its maximum and second maximum on two classes of chemical graphs. Finally, we will present new lower and upper bounds for the Randić index of connected chemical graphs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/7758172.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/7758172.xml (text/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:jnlmpe:7758172

DOI: 10.1155/2021/7758172

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().