K-edge-connected graph

Known as: Edge connectivity, Edge-connectivity

In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. The edge-connectivity of a…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2012

A k-lift of a graph G is a graph with vertex set V (G) � [k], and for each edge (i;j) 2 E(G) there is a perfect matching between…

2011

Power consumption is one of the crucial issues in Wireless Sensor Networks (WSNs). It therefore has been the focus of many…

2009

Halin showed that every edge minimal, k-vertex connected graph has a vertex of degree k. In this note, we prove the analogue to…

2005

2005

A finite element method is developed to understand the in-plane, quasi–static compressive deformation mechanism and to predict…

2004

We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant…

1997

We prove that the Simplicity Preserving Edge-Connectivity Augmentation Problem and the problem of Increasing Edge-Connectivity by…

1997

Given a simple graph G=(V, E), the goal is to find a smallest set F of new edges such that G=(V, E/spl cup/F) is /spl kappa/ edge…

1991

L. Gaccetta and Purwanto School of Mathematics and Statistics Curtin University of Technology GPO Box U1987 Perth VA 6001…