2 papers
math.CO2022
On the Maximum Induced Matching Number of a Stacked-book graph
Tyao Charles Adefokun, Opeoluwa Lawrence Ogundipe, Deborah Olayide Ajayi
Suppose that G is a simple, undirected graph. An induced matching in G is a set of edges M in the edge set E(G) of G such that if e1, e2 in M, then no endpoint v1, v2 of e1 and e2…
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…