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] Sharp bounds for the general Randic index of graphs with fixed number of vertices and cyclomatic number
    Su, Guifu
    Wu, Yue
    Qin, Xiaowen
    Du, Junfeng
    Guo, Weili
    Zhang, Zhenghang
    Song, Lifei
    AIMS MATHEMATICS, 2023, 8 (12): : 29352 - 29367
  • [32] On General Degree-Eccentricity Index for Trees with Fixed Diameter and Number of Pendant Vertices
    Masre, Mesfin
    IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 2023, 14 (01): : 19 - 32
  • [33] Graphs with given number of cut vertices and extremal Merrifield-Simmons index
    Hua, Hongbo
    Zhang, Shenggui
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (10) : 971 - 980
  • [34] Unicyclic Graphs with Given Number of Cut Vertices and the Maximal Merrifield - Simmons Index
    Hua, Hongbo
    Xu, Xinli
    Wang, Hongzhuan
    FILOMAT, 2014, 28 (03) : 451 - 461
  • [35] On the Randic index of unicyclic graphs with k pendant vertices
    Pan, Xiang-Feng
    Xu, Jun-Ming
    Yang, Chao
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2006, 55 (02) : 409 - 417
  • [36] MINIMAL ACYCLIC DOMINATING SETS AND CUT-VERTICES
    Samodivkin, Vladmir
    MATHEMATICA BOHEMICA, 2005, 130 (01): : 81 - 88
  • [37] Finding cut-vertices in the square roots of a graph
    Ducoffe, Guillaume
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 158 - 174
  • [38] Cut and pendant vertices and the number of connected induced subgraphs of a graph
    Dossou-Olory, Audace A. V.
    EUROPEAN JOURNAL OF MATHEMATICS, 2021, 7 (02) : 766 - 792
  • [39] Cut and pendant vertices and the number of connected induced subgraphs of a graph
    Audace A. V. Dossou-Olory
    European Journal of Mathematics, 2021, 7 : 766 - 792
  • [40] Finding Cut-Vertices in the Square Roots of a Graph
    Ducoffe, Guillaume
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 234 - 248
12345