Minimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks


Abstract views: 21 / PDF downloads: 17

Authors

  • Albert William Department of Mathematics, Loyola College, Chennai, India
  • Indra Rajasingh School of Advanced Sciences, VIT University, Chennai, India
  • S.Roy Department of Mathematics, Loyola College, Chennai, India

Keywords:

Silicate network, brother cell, sierpi\'{n}ski gasket rhombus

Abstract

Given an undirected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for silicate network, brother cell and sierpi\'{n}ski gasket rhombus.

Downloads

Published

15-06-2014

How to Cite

Albert William, Indra Rajasingh, & S.Roy. (2014). Minimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks. International Journal of Mathematics And Its Applications, 2(2), 37–46. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/304

Issue

Vol. 2 No. 2 (2014)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.