sufficient conditions for maximally edge-connected and super-edge-connected graphs
|
|
|
|
|
|
|
|
نویسنده
|
volkmann lutz ,hong zhen-mu
|
|
منبع
|
communications in combinatorics and optimization - 2017 - دوره : 2 - شماره : 1 - صفحه:35 -41
|
|
چکیده
|
Let g be a connected graph with minimum degree δ and edgeconnectivity λ. a graph is maximally edge-connected if λ = δ, and it is superedge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. in this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or super-edge-connected if the number of edges is large enough.
|
|
کلیدواژه
|
edge-connectivity; maximally edge-connected graphs; superedge-connected graphs
|
|
آدرس
|
rwth aachen university, germany, anhui university of finance and economics, school of finance, china
|
|
پست الکترونیکی
|
zmhong@mail.ustc.edu.cn
|
|
|
|
|
|
|