1 paper
Opeyemi Oyewumi, Abolape D. Akwu
Let G be a simple and finite graph. A graph is said to be \textit{decomposed} into subgraphs H1 and H2 which is denoted by G=H1⊕H2, if G is the edge disjoint…