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 (236.8 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 the maximum atom-bond sum-connectivity index of unicyclic graphs with given diameter

Zhen Wang1,2Kai Zhou1,2( )
School of Big Data and Artificial Intelligence, Chizhou University, Chizhou 247000, China
Applied Mathematics Research Center, Chizhou University, Chizhou 247000, China
Show Author Information

Abstract

Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The atom-bond sum-connectivity (ABS) index was proposed recently and is defined as ABS(G)=uvE(G)dG(u)+dG(v)2dG(u)+dG(v), where dG(u) represents the degree of vertex uV(G). A connected graph G is called a unicyclic graph if |V(G)|=|E(G)|. In this paper, we determine the maximum ABS index of unicyclic graphs with given diameter. In addition, the corresponding extremal graphs are characterized.

CLC number: 05C12, 05C35

References

【1】
【1】
 
 
AIMS Mathematics
Pages 22239-22250

{{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:
Wang Z, Zhou K. On the maximum atom-bond sum-connectivity index of unicyclic graphs with given diameter. AIMS Mathematics, 2024, 9(8): 22239-22250. https://doi.org/10.3934/math.20241082

7

Views

0

Downloads

0

Crossref

0

Web of Science

5

Scopus

Received: 25 May 2024
Revised: 02 July 2024
Accepted: 09 July 2024
Published: 15 August 2024
©2024 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)