�of isomorphic copies of a given spanning subgraph G is said to be a suborthogonal double cover (SODC) of the complete bipartite graph
�by G, if every edge of
�belongs to exactly two members of
�and any two different elements from
�share at most one edge. In this paper, we construct the SODCs of complete bipartite graphs by disjoint union of certain class of caterpillars. In addition, we give a general method of constructing SODCs of complete bipartite graphs by the disjoint union of certain graph G.
