Abstract
Let G be a simple graph. The Randić index of G is defined as the sum of 1/du dv over all edges uv of G, where dv denotes the vertex degree of v in G. Dehghan-Zadeh, Ashrafi and Habibi gave Tetracyclic graphs with extremal values of Randić index. We first point out that Theorem 1 is not completely correct and the number of nonisomorphic tetracyclic graphs on seven vertices given in Fig. 4 is incomplete and incorrect and in this short note, we present the correct version of it.
Original language | English |
---|---|
Article number | 2050105 |
Journal | Asian-European Journal of Mathematics |
Volume | 13 |
Issue number | 6 |
DOIs | |
State | Published - 1 Sep 2020 |
Bibliographical note
Publisher Copyright:© 2020 World Scientific Publishing Company.
Keywords
- Randić index
- tetracyclic graph
ASJC Scopus subject areas
- General Mathematics