AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (248.2 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

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

School of Mathematics and Computational Sciences, Huaihua University, Huaihua, Hunan, China
Show Author Information

Abstract

A general VDB topological index of G is defined as

T I f ( G ) = v i v j 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 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.

CLC number: 05C05, 05C09, 05C92

References

【1】
【1】
 
 
AIMS Mathematics
Pages 21240-21253

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Su Z. Maximizing chemical trees of some vertex-degree-based topological indices with given number of pendant vertices. AIMS Mathematics, 2025, 10(9): 21240-21253. https://doi.org/10.3934/math.2025948

223

Views

1

Downloads

1

Crossref

1

Web of Science

2

Scopus

Received: 23 June 2025
Revised: 09 September 2025
Accepted: 11 September 2025
Published: 16 September 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)