Fault-tolerant designs in lattice networks on the Klein bottle
| Main Author: | Shabbir, Ayesha; Abdus Salam School of Mathematical Sciences, GC University, Lahore, Pakistan |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2014
|
| Subjects: | |
| Online Access: |
http://www.ejgta.org/index.php/ejgta/article/view/52 http://www.ejgta.org/index.php/ejgta/article/view/52/21 |
Daftar Isi:
- 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.