Affiliations: [a] Department of Mathematical Sciences, United Arab Emirates University, Al Ain, United Arab Emirates
| [b] Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Sector H-12, Islamabad, Pakistan
| [c] Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Pakistan
Correspondence:
[*]
Corresponding author. Muhammad Imran, Department of Mathematical Sciences, United Arab Emirates University, P. O. Box 15551, Al Ain, United Arab Emirates. E-mail: imrandhab@gmail.com.
Abstract: 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)(degH(a)degH(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
Hfgh
, where f, g, h ∈ {+ , -} of graphs by using combinatorial inequalities.
Keywords: General Randić index, transformation graph, semi-total-point graph, semi-total-line graph
