Title of article
Superconnectivity of regular graphs with small diameter Original Research Article
Author/Authors
Camino Balbuena، نويسنده , , Jianmin Tang، نويسنده , , Kim Marshall، نويسنده , , Yuqing Lin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
1349
To page
1353
Abstract
A graph is superconnected, for short super-image, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any image-regular graph of diameter image and odd girth image that if image, then the graph is super-image when image and a complete graph otherwise.
Keywords
Connectivity , Superconnectivity , Cutset , Diameter , Girth
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887065
Link To Document