Abstract: A graph G is
decomposable into subgraphs of G
if no has isolated vertices and the edge
set can be partitioned into subsets If for each i,
then G is
-decomposable. In this paper we obtain a necessary and sufficient condition for
a complete graph and a complete multipartite graph
to be
-decomposable.
