Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.5614/ejgta.2014.2.2.2 | ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS |
Keywords | Field | DocType |
fault-tolerance, Klein bottle, longest path or cycle, lattice network | Discrete mathematics,Combinatorics,Lattice (order),Existential quantification,Vertex (geometry),Klein bottle,Hexagonal crystal system,Lattice network,Fault tolerance,Longest path problem,Mathematics | Journal |
Volume | Issue | ISSN |
2 | 2 | 2338-2287 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| ayesha shabbir | 1 | 5 | 1.26 |