Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Minimum 2-edge Connected Spanning Subgraph of Certain Graphs

S. Roy1, Albert William1
1Department of Mathematics Loyola College, Chennai 600 034, India
  • Published: 28/02/2015

Abstract

Given an undirected 2-edge connected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for Butterfly network, Benes network, Honeycomb network and Sierpiński gasket graph.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
S. Roy, Albert William. Minimum 2-edge Connected Spanning Subgraph of Certain Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 092. 255-264. DOI: .