Fault-tolerant designs in lattice networks on the Klein bottle

Ayesha Shabbir


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.


fault-tolerance; Klein bottle; longest path or cycle; lattice network

Full Text:


DOI: http://dx.doi.org/10.5614/ejgta.2014.2.2.2


  • There are currently no refbacks.

ISSN: 2338-2287

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

View EJGTA Stats