Edge connectivity in graphs: an expansion theorem

Simple item page
dc.creatorAlvarez-Hamelin, José Ignacio
dc.creatorBusch, Jorge Rodolfo
dc.date2008-03-20
dc.date2008-05-21
dc.date.accessioned2026-07-07T12:17:48Z
dc.date.available2026-07-07T12:17:48Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0803.3057
dc.identifierhttp://arxiv.org/abs/0803.3057
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212197
dc.subjectGeneral Mathematics
dc.titleEdge connectivity in graphs: an expansion theorem
dc.typetext

Files

Collections

arXiv