On computing a conditional edge-connectivity of a graph
Information Processing Letters
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Extraconnectivity of graphs with large girth
Discrete Mathematics - Special issue on graph theory and applications
On the extraconnectivity of graphs
Discrete Mathematics - Special issue on combinatorics
On connectivity of the Cartesian product of two graphs
Applied Mathematics and Computation
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
Graph Theory With Applications
Graph Theory With Applications
On the edge-connectivity and restricted edge-connectivity of a product of graphs
Discrete Applied Mathematics
On the 3-restricted edge connectivity of permutation graphs
Discrete Applied Mathematics
On optimally-λ(3) transitive graphs
Discrete Applied Mathematics
Edge fault tolerance of super edge connectivity for three families of interconnection networks
Information Sciences: an International Journal
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Vulnerability of super edge-connected networks
Theoretical Computer Science
| Hi-index | 0.05 |
A connected graph G is super edge connected (super-@l for short) if every minimum edge cut of G is the set of edges incident with some vertex. We define a super-@l graph G to be m-super-@l if G-S is still super-@l for any edge subset S with |S|=