Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Minimum 2-edge connected spanning subgraph of certain graphs
Roy Santiago
,
A. William
Published in Charles Babbage Research Centre
2015
Volume: 92
Pages: 255 - 264
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.
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Publisher
Charles Babbage Research Centre
ISSN
08353026
Authors (1)
Roy Santiago
Department of Mathematics
School of Advanced Sciences
Vellore Campus
Recent publications
Packing chromatic number of certain fan and wheel related graphs
Packing chromatic number of bismuth tri-iodide and first type nanostar dendrimers
Minimum 2-edge connected spanning subgraph of certain graphs
Wiener index of hypertree
Get all the updates for this publication
Follow