Paper Info
Title
On the existence of super edge-connected graphs with prescribed degrees.
Abstract
Let G be a connected graph of order n, minimum degree δ(G), and edge-connectivity κ′(G). The graph G is maximally edge-connected if κ′(G)=δ(G) and super edge-connected if every minimum edge-cut consists of edges incident with a vertex of minimum degree.
Year
DOI
Venue
2014
10.1016/j.disc.2014.03.025
Discrete Mathematics
Keywords
Field
DocType
Edge-connectivity,Super edge-connected,Degree list,Graphic list
Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Connectivity,Mathematics
Journal
Volume
ISSN
Citations 
328
0012-365X
0
PageRank 
References 
Authors
0.34
2
4
Name
Order
Citations
PageRank
Yingzhi Tian1209.28
Jixiang Meng235355.62
Hongjian Lai342.42
Zhao Zhang4706102.46