Study on Hamiltonian laceability properties of Cayley graphs
Sowmya Krishna, Leena N Shenoy · AIP conference proceedings · 2022
A bipartie graph G(V0 ∪V1, E) is said to be Hamiltonian laceable, if there exists a u − v H-path such that u∈ V0 and v ∈ V1. A non bipartite graph G(V, E) is defined to be random hamiltonian laceable, if there is a u - v H-path ∀ u, v ∈ V and it is defined to be partial random hamiltonian laceable, if there is a u - v H-path ∀ u, v ∈ V thus d(u, v) = t, where t is either odd or even. Cayley graphs are special class of graphs that are suitable for designing interconnection networks. Hamiltonian laceability of families of Cayley graphs namely Knödel Graph and Cube connected complete graph are studied in this research article.