i-Hamiltonian laceability in Shadow Graphs
M.R Sumitra Devi, A Girisha · Journal of Physics Conference Series · 2021
Abstract Extracting a Hamiltonian path or cycle in a connected graph G(V,E)has a wide scope in graph theory. Determination of Hamiltonian path in different graph structures is widely researched problem. If h ( g ) is the size of a Hamiltonian walk in G then G is termed as i-Hamiltonian, if h ( g )= n + i, n is the order of G. Here we characterize i- Hamiltonian-t-laceability properties in shadow graph of paths and cycles.