Graphs with small distance-based complexities

被引：3
作者：
Ghorbani, Modjtaba [1 ]
Vaziri, Zahra [1 ]
机构：
[1] Shahid Rajaee Teacher Training Univ, Fac Sci, Dept Math, Tehran 16785163, Iran
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2023年 / 457卷
关键词：
Szeged index; Szeged complexity; Wiener index; Wiener complexity; Windmill graph; Duch windmill graph; TOPOLOGICAL INDEXES; DIMENSION;
D O I：
10.1016/j.amc.2023.128188
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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. & COPY; 2023 Elsevier Inc. All rights reserved.
引用
收藏
页数：10
相关论文
共 50 条
12345