2 citations · 2 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2019
and decomposition of the tensor product of complete graphs
Opeyemi Oyewumi, Abolape D. Akwu
Let be a simple and finite graph. A graph is said to be \textit{decomposed} into subgraphs and which is denoted by , if is the edge disjoint…
math.CO2016
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…
math.CO2016★ 2 cited
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…