Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

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

Version 1 : Received: 6 November 2022 / Approved: 8 November 2022 / Online: 8 November 2022 (10:20:20 CET)

How to cite: Ozkan Kizilirmak, G.; Sevgi, E.; Buyukkose, S.; Cangul, I.N. Lower and Upper Bounds for Some Degree-Based Indices of Graphs. Preprints 2022, 2022110152. https://doi.org/10.20944/preprints202211.0152.v1 Ozkan Kizilirmak, G.; Sevgi, E.; Buyukkose, S.; Cangul, I.N. Lower and Upper Bounds for Some Degree-Based Indices of Graphs. Preprints 2022, 2022110152. https://doi.org/10.20944/preprints202211.0152.v1

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

graph; topological graph index

Subject

Computer Science and Mathematics, Computer Vision and Graphics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.