- Article
On 3-Restricted Edge Connectivity of Replacement Product Graphs
- Yilan Cui,
- Jianping Ou and
- Saihua Liu
A 3-restricted edge cut is an edge cut of a connected graph that separates this graph into components, each having an order of at least 3. The minimum size of all 3-restricted edge cuts of a graph is called its 3-restricted edge connectivity. This wo...

