Graphs with small distance-based complexities

Modjtaba Ghorbani and Zahra Vaziri

Applied Mathematics and Computation, 2023, vol. 457, issue C

Abstract: Suppose G is a connected graph. The Wiener complexity (or briefly W-complexity) CW(G) is the number of different contributions to Wiener index in its summation formula. Also, the Szeged complexity (or briefly Sz-complexity) CSz(G) can be defined similarly. The main goal of the current work is to investigate graphs with small complexity. We classify all unicycle graphs, all distance-balanced graphs, and all regular graphs of diameter 2 with Sz-complexity one. In this way, the Sz-complexity and W-complexity of several families of graphs are determined.

Keywords: Szeged index; Szeged complexity; Wiener index; Wiener complexity; Windmill graph; Duch windmill graph (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323003570
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:457:y:2023:i:c:s0096300323003570

DOI: 10.1016/j.amc.2023.128188

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