The Minimal Molecular Tree for the Exponential Randić Index

Topological indices are numerical parameters that provide a way to quantify the structural features of molecules using their graph representations. In chemical graph theory, these indices have been effectively employed to predict various physico-chemical properties of molecules. Among these, the Randić index stands out as a classical and widely used molecular descriptor in chemistry and pharmacology. The Randić index R(G) for a given graph G is defined as R(G)=∑vivj∈E(G)1d(vi)d(vj), where d(vi) represents the degree of vertex vi and E(G) is the set of edges in the graph G. Given the Randić index’s strong discrimination ability in describing molecular structures, a variant known as the exponential Randić index was recently introduced. The exponential Randić index ER(G) for a graph G is defined as ER(G)=∑vivj∈E(G)e1d(vi)d(vj). This paper further explores and fully characterizes the minimal molecular trees in relation to the exponential Randić index. Moreover, the chemical relevance of the exponential Randić index is also investigated.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-11-18
DOI
https://doi.org/10.3390/math12223601
Citations
3
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
3.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Minimal Molecular Tree for the Exponential Randić Index

Kinkar Chandra Das, Jayanta Bera
3 citations
Mathematics
Graph theory and applications
3.04
article

The Minimal Molecular Tree for the Exponential Randić Index

Kinkar Chandra Das, Jayanta Bera
article en
3 citations

Abstract

Topological indices are numerical parameters that provide a way to quantify the structural features of molecules using their graph representations. In chemical graph theory, these indices have been effectively employed to predict various physico-chemical properties of molecules. Among these, the Randić index stands out as a classical and widely used molecular descriptor in chemistry and pharmacology. The Randić index R(G) for a given graph G is defined as R(G)=∑vivj∈E(G)1d(vi)d(vj), where d(vi) represents the degree of vertex vi and E(G) is the set of edges in the graph G. Given the Randić index’s strong discrimination ability in describing molecular structures, a variant known as the exponential Randić index was recently introduced. The exponential Randić index ER(G) for a graph G is defined as ER(G)=∑vivj∈E(G)e1d(vi)d(vj). This paper further explores and fully characterizes the minimal molecular trees in relation to the exponential Randić index. Moreover, the chemical relevance of the exponential Randić index is also investigated.

MathematicsVol. 12(22)
Sungkyunkwan University (KR)
Peace, Justice and strong institutions, Reduced inequalities
Openalex Percentile: Top 8%
Graph theory and applications
3.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Minimal Molecular Tree for the Exponential Randić Index — Kinkar Chandra Das, Jayanta Bera · Mathematics (2024) | TGRS Research Map | TGRS