3 citations · 7 across the 6 of their papers we have counts for
9 papers
Hypergraphs for multiscale cycles in structured data
Agnese Barbensi, Iris H. R. Yoon, Christian Degnbol Madsen +3
Scientific data has been growing in both size and complexity across the modern physical, engineering, life and social sciences. Spatial structure, for example, is a hallmark of man…
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…
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…
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…