3 citations · 4 across the 3 of their papers we have counts for
5 papers
Bounds of the Radio Number of Stacked-Book Graphs with Odd Paths
TAyo Charles Adefokun, Deborah Olayide Ajayi
A Stacked-book graph Gm,n is obtained from the Cartesian product of a star graph Sm and a path Pn, where m and s are the orders of the star graph and the path respectively. Obtaini…
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…
On Radio Number of Stacked-Book Graphs
Tayo Charles Adefokun, Deborah Olayide Ajayi
A Stacked-book graph results from the Cartesian product of a star graph and path , where and are the orders of and respectively. A radio la…
On Maximum Induced Matching Numbers of Special Grids
Tayo C. Adefokun, Deborah O. A. Ajayi
A subset of the edge set of a graph is an induced matching of if given any two , none of the vertices on is adjacent to any of the vertices on $e_2…
Some bounds on the maximum induced matching numbers of certain grids
Deborah Olayide Ajayi, Tayo Charles Adefokun
An induced matching in a graph is a matching in that is also the edge set of an induced subgraph of . That is, any edge not in must have no more than one inciden…