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 条
12345