In this paper, we construct a family of graphs denoted by Eye(s) that are 3-regualr, 3-connected, planar, hamiltonian, edge hamiltonian, and also optimal 1-hamiltonian. Furthermore, the diameter of Eye(s) is O(log n), where n is the number of vertices in the graph and to be precise, n = 6(2s − 1) vertices.
Fault Tolerance Hamiltonian Cycle Disjoint Path Isomorphic Subgraph Recursive Construction
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.