On the extraconnectivity of graphs

被引：331

作者：

Fabrega, J ^{[1
]}

Fiol, MA ^{[1
]}

机构：

[1] UNIV POLITECN CATALUNYA,ETSE TELECOMUNICACIO,DEPT MATEMAT APLICADA & TELEMAT,BARCELONA 08034,SPAIN

来源：

DISCRETE MATHEMATICS | 1996年 / 155卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(94)00369-T

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Given a simple connected graph G, let kappa(n) [lambda(n)] be the minimum cardinality of a set of vertices [edges], if any, whose deletion disconnects G and every remaining component has more than n vertices. For instance, the usual connectivity and the superconnectivity of G correspond to kappa(0) and kappa(1), respectively. This paper gives sufficient conditions, relating the diameter of G with its girth, to assure optimum values of these conditional connectivities.

引用

页码：49 / 57

页数：9

共 10 条

[1] CIRCULANTS AND THEIR CONNECTIVITIES [J].