Preprint
Article

Lower and Upper Bounds for Some Degree-Based Indices of Graphs

Altmetrics

Downloads

201

Views

94

Comments

0

Submitted:

06 November 2022

Posted:

08 November 2022

You are already at the latest version

Alerts
Abstract
In this paper, we give some upper and lower bounds for the multiplicative Randic index, reduced reciprocal Randic index, Narumi-Katayama index and symmetric division index a graph using solely the vertex degrees. Then we obtain upper and lower bounds for these indices for the complete graphs, path graphs and Fibonacci-sum graphs. Finally, we compared the bounds of these indices for a general graph and some special graphs.
Keywords: 
Subject: Computer Science and Mathematics  -   Computer Vision and Graphics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated