Minimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Silicate network, brother cell, sierpi\'{n}ski gasket rhombusAbstract
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
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.