Wiener Index of Graphs with Fixed Number of Pendant or Cut-Vertices

被引：4

作者：

Pandey, Dinesh ^{[1
,2
]}

Patra, Kamal Lochan ^{[1
,2
]}

机构：

[1] Natl Inst Sci Educ & Res, Sch Math Sci, PO Jatni, Bhubaneswar 752050, Odisha, India

[2] Homi Bhabha Natl Inst, Training Sch Complex, Mumbai 400094, Maharashtra, India

来源：

CZECHOSLOVAK MATHEMATICAL JOURNAL | 2022年 / 72卷 / 02期

关键词：

cut-vertex; distance; pendant vertex; unicyclic graph; Wiener index; UNICYCLIC GRAPHS; MEAN DISTANCE; TREES; SUM;

D O I：

10.21136/CMJ.2022.0515-20

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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

页数：21

共 23 条

[1] AVERAGE DISTANCES IN UNDIRECTED GRAPHS AND THE REMOVAL OF VERTICES [J].