3 citations · 10 across the 10 of their papers we have counts for
10 papers · 1 filter
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…
Totally Antimagic Total labeling of Ladders, Prisms and Generalised Pertersen graphs
Deborah O. A. Ajayi, Abolape D. Akwu
Given a graph , a total labeling on is called edge-antimagic total (respectively, vertex-antimagic total) if all edge-weights (respectively, vertex-weights) are pairwise dis…
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…
On totally antimagic total labeling of complete bipartite graphs
Abolape D. Akwu, Deborah O. A. Ajayi
This paper deals with the problem of finding totally antimagic total labelings of complete bipartite graphs. We prove that complete bipartite graphs are totally antimagic total gra…
Labeling of Direct Product of Cycles
Tayo Charles Adefokun, Deborah Olayide Ajayi
An -labeling of a graph is an assignment of labels from to the vertices of such that two vertices that are adjacent or have a common neighbor r…
Distance two labeling of direct product of paths and cycles
Deborah O. A. Ajayi, Tayo C. Adefokun
Suppose that is a set of non-negative integers and . The -labeling of graph is the function such th…