Every nation’s economy is centered on its transportation networks, which are also reshaping the global economy. Utilize graph decomposition techniques to optimize transportation networks to save travel times and fuel expenses. A 2−simple graphoidal cover(2-simple g.c) of G is a set  G of (not necessarily open) paths in G such that every edge is in exactly one path in  G and every vertex is an internal vertex of at most two paths in  G and any two paths in  G has at most one vertex in common. The minimum cardinality of the 2−simple graphoidal cover (2-simple g.c) of G is called the 2−simple graphoidal covering number of G and is denoted by 2 .  s In this study, we discuss decomposition of complete bipartite graphs using 2-simple graphoidal covers.