Efficient algorithm on exponential Wiener index and QSPR analysis of alkanes and benzenoid hydrocarbons

Any graph that depicts a particular molecular structure can be given a topological graph index, also known as a molecular descriptor. From this index, it is possible to examine numerical data and learn more about some of the physical characteristics of a molecule. In this study, we construct and explore a novel variation for graphs termed the exponential Wiener index (EW(G)) and the multiplicative exponential Wiener index [Formula: see text]. Typical graphs for which it is also conceivable include the wheel graph, fan graph, star graph, full graph, cycle graph, complete graph, and complete bipartite graph. Additionally, some EW(G) bounds are determined using exponential inequalities. In the end, an algorithm is created to obtain EW(G), and the most effective is investigated. This work is also extended to the molecular graphs for n-alkanes, n = 1,2,..., 10 and benzenoid hydrocarbons. Additionally, a QSPR study that takes into account the molecular mass, melting point, and boiling point of alkanes and total π-electronic energy [Formula: see text], enthalpy of formation [Formula: see text], and boiling points have been conducted. The influential measures such as DFBETAS, DFFITS, Hadi's measure, are calculated by which the influential parameters and the outliers are identified for the regression models between the topological index and these physical parameters.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-09-30
DOI
https://doi.org/10.1038/s41598-025-14260-0
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient algorithm on exponential Wiener index and QSPR analysis of alkanes and benzenoid hydrocarbons

K. Kannan, A. Menaga, S. Punitha
Scientific Reports
Graph theory and applications
article

Efficient algorithm on exponential Wiener index and QSPR analysis of alkanes and benzenoid hydrocarbons

K. Kannan, A. Menaga, S. Punitha
article en

Abstract

Any graph that depicts a particular molecular structure can be given a topological graph index, also known as a molecular descriptor. From this index, it is possible to examine numerical data and learn more about some of the physical characteristics of a molecule. In this study, we construct and explore a novel variation for graphs termed the exponential Wiener index (EW(G)) and the multiplicative exponential Wiener index [Formula: see text]. Typical graphs for which it is also conceivable include the wheel graph, fan graph, star graph, full graph, cycle graph, complete graph, and complete bipartite graph. Additionally, some EW(G) bounds are determined using exponential inequalities. In the end, an algorithm is created to obtain EW(G), and the most effective is investigated. This work is also extended to the molecular graphs for n-alkanes, n = 1,2,..., 10 and benzenoid hydrocarbons. Additionally, a QSPR study that takes into account the molecular mass, melting point, and boiling point of alkanes and total π-electronic energy [Formula: see text], enthalpy of formation [Formula: see text], and boiling points have been conducted. The influential measures such as DFBETAS, DFFITS, Hadi's measure, are calculated by which the influential parameters and the outliers are identified for the regression models between the topological index and these physical parameters.

Scientific ReportsVol. 15(1)
SASTRA University (IN)
Openalex Percentile: Top 67%
Graph theory and applications
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.