On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves

Jianwei Du and Xiaoling Sun

Applied Mathematics and Computation, 2024, vol. 464, issue C

Abstract: A tree in which no vertex has a degree greater than 4 is called a chemical tree. The bond incident degree index of a chemical tree T is defined as ∑xy∈ETφ(degT(x),degT(y)), where ET is the edge set of T, φ is a real-valued symmetric function, and degT(x) stands for the degree of a vertex x of T. This paper reports extremal results on bond incident degree indices of chemical trees with a fixed order and a fixed number of leaves. Furthermore, we use these results directly to some renowned topological indices, such as symmetric division deg index, Randić index, geometric-arithmetic index, sum-connectivity index, Sombor index, harmonic index, multiplicative sum Zagreb index, atom-bond connectivity index, etc.

Keywords: Bond incident degree index; Chemical tree; Leaf (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323005593
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:464:y:2024:i:c:s0096300323005593

DOI: 10.1016/j.amc.2023.128390

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().