2008/03/20 by J. Ignacio Alvarez-Hamelin, Alvarez-Hamelin, José Ignacio, Jorge R. Busch +1
Computer Science · Materials Science · #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graphene research and applications #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.0803.3057
openalex publication_date 2008/03/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.