GRAPHS WITH EQUAL EDGE CONNECTIVITY AND MINIMUM DEGREE

被引：20

作者：

BOLLOBAS, B

机构：

[1] University of Cambridge, Cambridge, CB2 1SB England

来源：

DISCRETE MATHEMATICS | 1979年 / 28卷 / 03期

关键词：

D O I：

10.1016/0012-365X(79)90139-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The note contains some conditions on a graph implying that the edge connectivity is equal to the minimum degree. One of these conditions is that if d1≥d2≥⋯≥dn is the degree sequence then ∑ll-1(d1+dn-1)>In-1 for 1 ≤ l≤ min { n 2-1, dn}. © 1979.

引用

页码：321 / 323

页数：3

共 6 条

[1]

Bollobas B., 2004, LONDON MATH SOC MONO

[2] A GRAPH-THEORETIC APPROACH TO A COMMUNICATIONS PROBLEM [J].