Name
Abstract | ||
|---|---|---|
Let G = (V, E) be a connected multigraph with order n. delta(G) and lambda(G) are the minimum degree and edge connectivity, respectively. The multigraph G is called maximally edge-connected if lambda(G) = delta(G) and super edge-connected if every minimum edge-cut consists of edges incident with a vertex of minimum degree. A sequence D = (d(1), d(2), ..., d(n)) with d(1) >= d(2) >= ... >= d(n) is called a multigraphic sequence if there is a multigraph with vertices v(1), v(2), ..., v(n) such that d(v(i)) = d(i) for each i = 1, 2, ..., n. The multigraphic sequence D is super edge-connected if there exists a super edge-connected multigraph G with degree sequence D. In this paper, we present that a multigraphic sequence D with d(n) = 1 is super edge-connected if and only if Sigma(n)(i=1) d(i) >= 2n and give a sufficient and necessary condition for a multigraphic sequence D with d(n) = 2 to be super edge-connected. Moreover, we show that a multigraphic sequence D with d(n) >= 3 is always super edge-connected. |
Year | Venue | Keywords |
|---|---|---|
2016 | ARS COMBINATORIA | Super edge-connected,degree sequence,multigraphic sequence |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Mathematics | Journal | 127 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianglan Cao | 1 | 0 | 0.34 |
| Yingzhi Tian | 2 | 20 | 9.28 |
| Jixiang Meng | 3 | 353 | 55.62 |