Record number :
946939
Title of article :
Maximally edge-connected and vertex-connected graphs and digraphs: A survey Original Research Article
Author/Authors :
Angelika Hellwig، نويسنده , , Lutz Volkmann، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
32
From page :
3265
To page :
3296
Abstract :
Let D be a graph or a digraph. If image is the minimum degree, image the edge-connectivity and image the vertex-connectivity, then image is a well-known basic relationship between these parameters. The graph or digraph D is called maximally edge-connected if image and maximally vertex-connected if image. In this survey we mainly present sufficient conditions for graphs and digraphs to be maximally edge-connected as well as maximally vertex-connected. We also discuss the concept of conditional or restricted edge-connectivity and vertex-connectivity, respectively.
Keywords :
Connectivity , Edge-connectivity , Conditional connectivity , Super-edge-connectivity , Local-edge-connectivity , Minimum degree , Degree sequence , Diameter , Girth , Restricted connectivity , Clique number , Line graph , Vertex-connectivity
Journal title :
Discrete Mathematics
Serial Year :
2008
Link To Document :
بازگشت