Sharp bounds for the general Randić index of transformation graphs

Muhammad Imran, Shehnaz Akhter, Hani Shaker

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)7787-7794
Number of pages8
JournalJournal of Intelligent and Fuzzy Systems
Issue number5
Publication statusPublished - 2020


  • General Randić index
  • semi-total-line graph
  • semi-total-point graph
  • transformation graph

ASJC Scopus subject areas

  • Statistics and Probability
  • General Engineering
  • Artificial Intelligence


Dive into the research topics of 'Sharp bounds for the general Randić index of transformation graphs'. Together they form a unique fingerprint.

Cite this