Marzieh Pourbabaee

First and Second Maximum of Randić Index Among all $k-$Cyclic Graphs of a Given Order

Suppose $G$ is a simple graph with edge set $E(G)$. The Randić index $R(G)$ is defined as $R(G)=\sum_{uv\in E(G)}\frac{1}{\sqrt{deg_{G}(u)deg_{G}(v)}}$, where $deg_G(u)$ denotes the vertex degree of $u$ in $G$. In this paper, the first and second maximum of Randić index among all $n-$vertex $k-$cyclic graphs were computed.