collaborators

1 paper

math.CO2022

Hamiltonian Complete Number of Some Variants of Caterpillar Graphs

Tayo Charles Adefokun, Opeoluwa Lawrence Ogundipe, kingsley Nosa Onaiwu +1

A graph is said to be Hamiltonian if it contains a spanning cycle. In this work, we investigate the Hamiltonian completeness of certain classes of caterpillar graphs, which are…