Tetracyclic graphs with extremal values of Randic index

چکیده مقاله

Let G be a simple graph. The Randi´c index of G is defined as the sum of √ dG(u)dG(v) −1 over all edges uv of G, where dG(x) denotes the vertex degree of x in G. In this paper, the maximum and second maximum of Randi´c index in the set of all n−vertex tetracyclic graphs are computed.