Maximizing chemical trees of some vertex-degree-based topological indices with given number of pendant vertices

A general VDB topological index of $ G $ is defined as$ \mathcal{TI}_f(G) = \sum\limits_{v_iv_j\in E(G)} f(d_i,d_j), $where $ f(d_i, d_j) $ is a symmetric function, and $ d_i $ represents the degree of $ v_i\in V(G) $. This paper aims to address the maximum chemical tree problem for general vertex-degree-based topological indices with given number of pendant vertices via a unified method. Sufficient conditions for general VDB topological indices to take their maximum value are presented, and as an application, we show that there are six VDB topological indices, including the reciprocal sum-connectivity index, the Sombor index, and the Euler Sombor index, etc., that satisfy these conditions.

Authors

Institutions

Publication Details

Journal
AIMS Mathematics
Published
2025-01-01
DOI
https://doi.org/10.3934/math.2025948
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

Maximizing chemical trees of some vertex-degree-based topological indices with given number of pendant vertices

Zhenhua Su
AIMS Mathematics
Graph theory and applications
article

Maximizing chemical trees of some vertex-degree-based topological indices with given number of pendant vertices

Zhenhua Su
article en

Abstract

A general VDB topological index of $ G $ is defined as$ \mathcal{TI}_f(G) = \sum\limits_{v_iv_j\in E(G)} f(d_i,d_j), $where $ f(d_i, d_j) $ is a symmetric function, and $ d_i $ represents the degree of $ v_i\in V(G) $. This paper aims to address the maximum chemical tree problem for general vertex-degree-based topological indices with given number of pendant vertices via a unified method. Sufficient conditions for general VDB topological indices to take their maximum value are presented, and as an application, we show that there are six VDB topological indices, including the reciprocal sum-connectivity index, the Sombor index, and the Euler Sombor index, etc., that satisfy these conditions.

AIMS MathematicsVol. 10(9)
Huaihua University (CN)
Openalex Percentile: Top 69%
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.