Hamiltonian Laceability in Book Graphs
2022 ◽
Vol 2161
(1)
◽
pp. 012032
Abstract A connected graph network G is a Hamilton-t-laceable (Hamilton- t*-laceable) if Ǝ in G a Hamilton path connecting each pair (at least one pair) of vertices at distance ‘t’ in G such that 1 ≤ t ≤ diameter (G). In this paper, we discuss the f-edge-Hamilton-t-laceability of Book and stacked Book graphs, where 1 ≤ t ≤ diameter (G).