Edge connectivity in graphs: an expansion theorem

José Ignacio Alvarez-Hamelin (1, 2) , Jorge Rodolfo Busch (1)

1 FIUBA - Facultad de Ingeniería [Buenos Aires]
2 CONICET - Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires]

We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting one graph to the other, the resulting graph is also k-edge-connected.

Mots clés: graphs; k-edge-connectivity

Domaines: Mathématiques générales [math.GM]

José Ignacio Alvarez-Hamelin, Jorge Rodolfo Busch. Edge connectivity in graphs: an expansion theorem. 2008. ⟨hal-00266074v2⟩