Wiener index of graphs with fixed number of pendant or cut-vertices

被引：0
|
作者：
Dinesh Pandey
Kamal Lochan Patra
机构：
[1] National Institute of Science Education and Research,School of Mathematical Sciences
[2] Homi Bhabha National Institute,undefined
[3] Training School Complex,undefined
来源：
Czechoslovak Mathematical Journal | 2022年 / 72卷
关键词：
cut-vertex; distance; pendant vertex; unicyclic graph; Wiener index; 05C05; 05C12; 05C35;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. We characterize the graphs which extremize the Wiener index among all graphs on n vertices with k pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on n vertices with s cut-vertices.
引用
收藏
页码：411 / 431
页数：20
相关论文
共 50 条
  • [31] The minimum Sombor index of trees with given number of pendant vertices
    Venkatesan Maitreyi
    Suresh Elumalai
    Selvaraj Balachandran
    Hechao Liu
    Computational and Applied Mathematics, 2023, 42
  • [32] The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant Vertices
    Fan, Yi-Zheng
    Yang, Dan
    GRAPHS AND COMBINATORICS, 2009, 25 (03) : 291 - 298
  • [33] On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices
    Tomescu, Ioan
    Arshad, Misbah
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 306 - 309
  • [34] The structure of graphs with given number of blocks and the maximum Wiener index
    Bessy, Stephane
    Dross, Francois
    Hrinakova, Katarina
    Knor, Martin
    Skrekovski, Riste
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (01) : 170 - 184
  • [35] Wiener index of graphs with more than one cut-vertex
    Balakrishnan, R.
    Sridharan, N.
    Iyer, K. Viswanathan
    APPLIED MATHEMATICS LETTERS, 2008, 21 (09) : 922 - 927
  • [36] The structure of graphs with given number of blocks and the maximum Wiener index
    Stéphane Bessy
    François Dross
    Katarína Hriňáková
    Martin Knor
    Riste Škrekovski
    Journal of Combinatorial Optimization, 2020, 39 : 170 - 184
  • [37] Comparative results between the number of subtrees and Wiener index of graphs
    Xu, Kexiang
    Li, Jie
    Luo, Zuwen
    RAIRO-OPERATIONS RESEARCH, 2022, 56 (04) : 2495 - 2511
  • [38] On Graphs with Cut Vertices and Cut Edges
    Fang, Kun Fu
    Shu, Jin Long
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2014, 30 (03) : 539 - 546
  • [39] On Graphs with Cut Vertices and Cut Edges
    Kun Fu FANG
    Jin Long SHU
    ActaMathematicaSinica(EnglishSeries), 2014, 30 (03) : 539 - 546
  • [40] On graphs with cut vertices and cut edges
    Kun Fu Fang
    Jin Long Shu
    Acta Mathematica Sinica, English Series, 2014, 30 : 539 - 546
12345