Sharp bounds for the general Randić index of transformation graphs

Inequalities are a useful method to investigate and compare topological indices of graphs relatively. A large collection of graph associated numerical descriptors have been used to examine the whole structure of networks. In these analysis, degree related topological indices have a significant position in theoretical chemistry and nanotechnology. Thus, the computation of degree related indices is one of the successful topic of research. Given a molecular graph H , the general Randić connectivity index is interpreted as R α ( H ) = ∑ ℛ ∈ E ( H ) ( deg H ( a ) deg H ( b ) ) α , with α is a real quantity. Also a graph transformation of H provides a comparatively simpler isomorphic structure with an ease to work on different chemical properties. In this article, we determine the sharp bounds of general Randić index of numerous graph transformations, such that semi-total-point, semi-total-line, total and eight individual transformations H fgh , where f, g, h ∈ {+ , -} of graphs by using combinatorial inequalities.