Article
Version 1
Preserved in Portico This version is not peer-reviewed
Tricyclic Graph with Minimum Randić Index
Version 1
: Received: 16 September 2023 / Approved: 18 September 2023 / Online: 19 September 2023 (07:59:59 CEST)
A peer-reviewed article of this Preprint also exists.
Tang, L.; Song, Z.; Lin, M. Tricyclic Graph with Minimum Randić Index. Symmetry 2023, 15, 2086. Tang, L.; Song, Z.; Lin, M. Tricyclic Graph with Minimum Randić Index. Symmetry 2023, 15, 2086.
Abstract
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.
Keywords
Randić index; tricyclic graph; graph transformation
Subject
Chemistry and Materials Science, Theoretical Chemistry
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
