Fault-tolerant designs in lattice networks on the Klein bottle
<p>In this note, we consider triangular, square and hexagonal lattices on the flat Klein bottle, and find subgraphs with the property that for any $j$ vertices there exists a longest path (cycle) avoiding all of them. This completes work previously done in other lattices.</p>
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2014-10-01
|
| 叢編: | Electronic Journal of Graph Theory and Applications |
| 主題: | |
| 在線閱讀: | http://www.ejgta.org/index.php/ejgta/article/view/52 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|