Cacti with n-vertices and t cycles having extremal Wiener index

被引:32
|
作者
Gutman, Ivan [1 ,2 ]
Li, Shuchao [3 ]
Wei, Wei [3 ]
机构
[1] Univ Kragujeva, Fac Sci, Kragujevac 34000, Serbia
[2] State Univ Novi Pazar, Novi Pazar, Serbia
[3] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Wiener index; Cactus; Extremal graph; GRAPHS; DISTANCE;
D O I
10.1016/j.dam.2017.07.023
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The Wiener index W(G) of a connected graph G is the sum of distances between all pairs of vertices of G. A connected graph G is said to be a cactus if each of its blocks is either a cycle or an edge. Let g(n,t) be the set of all n-vertex cacti containing exactly t cycles. Liu and Lu (2007) determined the unique graph in g(n,t) with the minimum Wiener index. We now establish a sharp upper bound on the Wiener index of graphs in g(n,t) and identify the corresponding extremal graphs. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:189 / 200
页数:12
相关论文
共 9 条
  • [1] Extremal Polygonal Cacti for Wiener Index and Kirchhoff Index
    Zeng, Mingyao
    Xiao, Qiqi
    Tang, Zikai
    Deng, Hanyuan
    IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 2020, 11 (03): : 201 - 211
  • [2] The second-minimum Wiener index of cacti with given cycles
    Deng, Hanyuan
    Keerthi Vasan, G. C.
    Balachandran, S.
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2021, 14 (03)
  • [3] A note on the augmented Zagreb index of cacti with fixed number of vertices and cycles
    Ali, Akbar
    Bhatti, Akhlaq A.
    KUWAIT JOURNAL OF SCIENCE, 2016, 43 (04) : 11 - 17
  • [4] Extremal Wiener Index of Trees with Given Number of Vertices of Even Degree
    Lin, Hong
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2014, 72 (01) : 311 - 320
  • [5] Extremal Wiener Index of Graphs with Given Number of Vertices of Odd Degree
    Su, Zhenhua
    Tang, Zikai
    Deng, Hanyuan
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2023, 89 (02) : 503 - 516
  • [6] ORDERING CACTI WITH n VERTICES AND k CYCLES BY THEIR LAPLACIAN SPECTRAL RADII
    Guo, Shu-Guang
    Wang, Yan-Feng
    PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD, 2012, 92 (106): : 117 - 125
  • [7] More Trees with All Degrees Odd Having Extremal Wiener Index
    Furtula, Boris
    Gutman, Ivan
    Lin, Hong
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 70 (01) : 293 - 296
  • [8] The hyper-Wiener index of unicyclic graphs with n vertices and k pendent vertices
    Cai, Gai-Xiang
    Yu, Gui-Dong
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2016, 19 (01): : 57 - 65
  • [9] Note on the Minimal Wiener Index of Connected Graphs With n Vertices and Radius r
    You, Zhifu
    Liu, Bolian
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2011, 66 (01) : 343 - 344