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 (244.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

On trees with a given number of segments and their maximum general Z-type index

Hicham Saber1Zahid Raza2Abdulaziz M. Alanazi3Adel A. Attiya1Akbar Ali1( )
Department of Mathematics, College of Science, University of Ha'il, Ha'il, Saudi Arabia
Department of Mathematics, College of Sciences, University of Sharjah, Sharjah, UAE
Department of Mathematics, Faculty of Sciences, University of Tabuk, Tabuk, Saudi Arabia
Show Author Information

Abstract

The general Z-type index is a molecular descriptor, introduced recently by Chen and Lin [Discrete Optim., 50 (2023), 100808], which generalizes several well-known molecular descriptors, including the (general) sum-connectivity index and (general) Platt index. The primary objective of the current paper is to study the largest value of the general Z-type index of graphs in the class of all fixed-order trees (and chemical trees) with a particular number of segments.

CLC number: 05C05, 05C07; 05C09; 05C35; 05C92

References

【1】
【1】
 
 
AIMS Mathematics
Pages 195-207

{{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:
Saber H, Raza Z, Alanazi AM, et al. On trees with a given number of segments and their maximum general Z-type index. AIMS Mathematics, 2025, 10(1): 195-207. https://doi.org/10.3934/math.2025010

12

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 15 November 2024
Revised: 07 December 2024
Accepted: 07 December 2024
Published: 15 January 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)