Fault-tolerant designs in lattice networks on the Klein bottle

Abstract

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.

Keywords

• fault-tolerance
• klein bottle
• longest path or cycle
• lattice network