Minimally 3-restricted edge connected graphs

Authors:
Qinghai Liu;Yanmei Hong;Zhao Zhang
Affiliations:
College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China;College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China;College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 7
Cited 0

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
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
Sufficient conditions for λ′-optimality in graphs with girth g

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

For a connected graph G=(V,E), an edge set S@?E is a 3-restricted edge cut if G-S is disconnected and every component of G-S has order at least three. The cardinality of a minimum 3-restricted edge cut of G is the 3-restricted edge connectivity of G, denoted by @l"3(G). A graph G is called minimally 3-restricted edge connected if @l"3(G-e)