The Randić index of a graph G is the sum of (dG(u)dG(v))−1/2 over all edges uv of G, where dG(u) denotes the degree of vertex u in G. In this paper, we investigate a few graph transformations that decrease Randić index of graph. By applying those transformations, we determine the minimum Randić index on tricyclic graphs, and characterize the corresponding extremal graphs.
We use cookies on our website to ensure you get the best experience. Read more about our cookies here.
RSS feed for
Preprints: The Multidisciplinary Preprint Platform
Paste the URL in your RSS reader:
https://www.preprints.org/rss
If you want to subscribe our website in subject-wide, you could find the URL by choosing in the following: