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
相关论文
共 38 条
[1]  
Althöfer L(1990)Average distances in undirected graphs and the removal of vertices J. Comb. Theory, Ser. B 48 140-142
[2]  
Balakrishnan R(2008)Wiener index of graphs with more than one cut-vertex Appl. Math. Lett. 21 922-927
[3]  
Sridharan N(1994)Average distance and independence number Discrete Appl. Math. 51 75-83
[4]  
Viswanathan Iyer K(1977)Mean distance in a graph Discrete Math. 17 147-154
[5]  
Dankelmann P(1976)Distance in graphs Czech. Math. J. 26 283-296
[6]  
Doyle J K(1988)On distances in some bipartite graphs Publ. Inst. Math., Nouv. Sér. 43 3-8
[7]  
Graver J E(2014)Wiener index of Eulerian graphs Discrete Appl. Math. 162 247-250
[8]  
Entringer R C(2003)Superdominance order and distance of trees with bounded maximum degree Discrete Appl. Math. 125 225-233
[9]  
Jackson D E(2007)A unified approach to extremal cacti for different indices MATCH Commun. Math. Comput. Chem. 58 183-194
[10]  
Snyder D A(2008)On the Wiener index of trees with fixed diameter MATCH Commun. Math. Comput. Chem. 60 85-94
1234