On computing a conditional edge-connectivity of a graph
Information Processing Letters
Extraconnectivity of graphs with large girth
Discrete Mathematics - Special issue on graph theory and applications
Extraconnectivity of graphs with large minimum degree and girth
Discrete Mathematics
On restricted edge-connectivity of graphs
Discrete Mathematics
Edge-cuts leaving components of order at least three
Discrete Mathematics
Optimally super-edge-connected transitive graphs
Discrete Mathematics
On the construction of most reliable networks
Discrete Applied Mathematics
| Hi-index | 5.23 |
An edge subset F of a connected graph G=(V,E) is a k-restricted edge cut if G-F is disconnected, and every component of G-F has at least k vertices. The k-restricted edge connectivity of G, denoted by @l"k(G), is the cardinality of a minimum k-restricted edge cut. By the current studies on @l"k, it can be seen that the larger @l"k is, the more reliable the graph is. Hence one expects @l"k to be as large as possible. A possible upper bound for @l"k is @x"k defined as @x"k(G)=min{@w(S):0@?S@?V(G),|S|=k and G[S] is connected }, where @w(S) is the number of edges with one end in S and the other end in V(G)@?S, and G[S] is the subgraph of G induced by S. A graph G is called @l"k-optimal if @l"k(G)=@x"k(G). A natural question is whether there exists a graph G which is @l"k-optimal for any k@?|V(G)|/2. In this paper, we show that except for two cases, the elementary Harary graph has this property.