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 条
  • [1] On the ordering of distance-based invariants of graphs
    Liu, Muhuo
    Das, Kinkar Ch.
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 324 : 191 - 201
  • [2] A DISTANCE-BASED FORMULATION FOR SAMPLING SIGNALS ON GRAPHS
    Jayawant, Ajinkya
    Ortega, Antonio
    2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2018, : 6318 - 6322
  • [3] On Properties of Distance-Based Entropies on Fullerene Graphs
    Ghorbani, Modjtaba
    Dehmer, Matthias
    Rajabi-Parsa, Mina
    Mowshowitz, Abbe
    Emmert-Streib, Frank
    ENTROPY, 2019, 21 (05):
  • [4] Distance-based topological polynomials and indices of friendship graphs
    Gao, Wei
    Farahani, Mohammad Reza
    Imran, Muhammad
    Kanna, M. R. Rajesh
    SPRINGERPLUS, 2016, 5
  • [5] A Distance-based Approach for Semantic Dissimilarity in Knowledge Graphs
    De Nies, Tom
    Beecks, Christian
    Godin, Frederic
    De Neve, Wesley
    Stepien, Grzegorz
    Arndt, Dorthe
    De Vocht, Laurens
    Verborgh, Ruben
    Seidl, Thomas
    Mannens, Erik
    Van de Walle, Rik
    2016 IEEE TENTH INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC), 2016, : 253 - 256
  • [6] Distance-Based Topological Descriptors of Capra Operation on Some Graphs
    Malik, Mehar Ali
    Aqib, Muhammad
    Batool, Iqra
    Muhammad Humza, Hafiz
    POLYCYCLIC AROMATIC COMPOUNDS, 2024, 44 (04) : 2644 - 2658
  • [7] A Survey on Graphs Extremal with Respect to Distance-Based Topological Indices
    Xu, Kexiang
    Liu, Muhuo
    Das, Kinkar Ch.
    Gutman, Ivan
    Furtula, Boris
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2014, 71 (03) : 461 - 508
  • [8] Critical nodes for distance-based connectivity and related problems in graphs
    Veremyev, Alexander
    Prokopyev, Oleg A.
    Pasiliao, Eduardo L.
    NETWORKS, 2015, 66 (03) : 170 - 195
  • [9] Resistance distance-based graph invariants of subdivisions and triangulations of graphs
    Yang, Yujun
    Klein, Douglas J.
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 260 - 274
  • [10] Extremal graphs with respect to two distance-based topological indices?
    Zhang, Wanping
    Meng, Jixiang
    Wu, Baoyindureng
    DISCRETE APPLIED MATHEMATICS, 2022, 317 : 63 - 74
12345