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 (2.2 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline

Sharp Bounds for Wiener Index of Maximal Outerplanar Graphs

School of Mathematics and System Sciences, Xinjiang University, Urumqi Xinjiang 830017, China
Show Author Information

Abstract

A graph is outerplanar if it has a crossing-free embedding in the plane such that all vertices are on the boundary of its outer face. An outerplanar graph is maximal outerplanar if no edge can be added without losing outerplanarity. The Wiener index of a graph G is the sum of distances between all pairs of vertices of G. We show that for a maximal outerplanar graph G on n vertices, W(K1Pn−1) ≤W(G)≤W( Pn2), where K1Pn−1 is the graph obtained from joining a vertex to each vertex of Pn−1 and Pn2 is the square of Pn.

CLC number: O157.5 Document code: A Article ID: 2096-7675(2023)05-0560-05

References

【1】
【1】
 
 
Journal of Xinjiang University(Natural Science Edition in Chinese and English)
Pages 560-564

{{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:
SUN X, AN X. Sharp Bounds for Wiener Index of Maximal Outerplanar Graphs. Journal of Xinjiang University(Natural Science Edition in Chinese and English), 2023, 40(5): 560-564. https://doi.org/10.13568/j.cnki.651094.651316.2023.01.04.0001

668

Views

17

Downloads

0

Crossref

Received: 04 January 2023
Published: 01 September 2023
© 2023 Journal of Xinjiang University (Natural Science Edition in Chinese and English)