MINIMUM EDGE CUTS IN DIAMETER 2 GRAPHS

被引：3

作者：

Bickle, Allan ^{[1
]}

Schwenk, Allen ^{[2
]}

机构：

[1] Penn State Altoona, Dept Math, 3000 Ivyside Pk, Altoona, PA 16601 USA

[2] Western Michigan Univ, Dept Math, 1903 W Michigan, Kalamazoo, MI 49008 USA

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2019年 / 39卷 / 02期

关键词：

edge connectivity; diameter;

D O I：

10.7151/dmgt.2097

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Plesnik proved that the edge connectivity and minimum degree are equal for diameter 2 graphs. We provide a streamlined proof of this fact and characterize the diameter 2 graphs with a nontrivial minimum edge cut.

引用

页码：605 / 608

页数：4