New Bounds for the Randić Index of Graphs
The Randić index of a graph G is defined as the sum of weights 1/dudv over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively. In this paper, we will obtain lower and upper bounds for the Randić index in terms of size, maximum degree, and minimum degree. Mo...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/9938406 |