The Extremal Unicyclic Graphs With Given Girth for Exponential VDB Topological Indices

Topological indices are widely used molecular structure descriptors in chemistry and pharmaceutics, which help analyze and predict the physicochemical properties and biological activity of compounds. Focusing on the discriminative power, researchers introduced the general exponential VDB topological index, which is defined as follows: . Our current work focuses on studying of some exponential VDB topological indices using general methods. In the paper, we characterize the sufficient conditions for that (1) the graph M n , k is the minimal among unicyclic graph with girth k and (2) the graph H n , k is the maximal among unicyclic graph with girth k , respectively. As an application, the minimal and the maximal unicyclic graphs for some exponential VDB indices are achieved. In addition, we summarize our achievements and propose future research directions in the conclusion.

Authors

Institutions

Publication Details

Journal
Journal of Mathematics
Published
2025-01-01
DOI
https://doi.org/10.1155/jom/4034455
Citations
1
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
4.09

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Extremal Unicyclic Graphs With Given Girth for Exponential VDB Topological Indices

Zikai Tang, Zhenhua Su
1 citations
Journal of Mathematics
Graph theory and applications
4.09
article

The Extremal Unicyclic Graphs With Given Girth for Exponential VDB Topological Indices

Zikai Tang, Zhenhua Su
article en
1 citations

Abstract

Topological indices are widely used molecular structure descriptors in chemistry and pharmaceutics, which help analyze and predict the physicochemical properties and biological activity of compounds. Focusing on the discriminative power, researchers introduced the general exponential VDB topological index, which is defined as follows: . Our current work focuses on studying of some exponential VDB topological indices using general methods. In the paper, we characterize the sufficient conditions for that (1) the graph M n , k is the minimal among unicyclic graph with girth k and (2) the graph H n , k is the maximal among unicyclic graph with girth k , respectively. As an application, the minimal and the maximal unicyclic graphs for some exponential VDB indices are achieved. In addition, we summarize our achievements and propose future research directions in the conclusion.

Journal of MathematicsVol. 2025(1)
Huaihua University (CN), Hunan Normal University (CN), Changsha Normal University (CN)
Natural Science Foundation of Hunan Province
Openalex Percentile: Top 11%
Graph theory and applications
4.09
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 Extremal Unicyclic Graphs With Given Girth for Exponential VDB Topological Indices — Zikai Tang, Zhenhua Su · Journal of Mathematics (2025) | TGRS Research Map | TGRS