A paired k -to- k disjoint path cover of a graph G is a collection of pairwise disjoint path subgraphs P 1 , P 2 , … , P k such that each P i has prescribed vertices s i and t i as endpoints and the union of P 1 , P 2 , … , P k contains all vertices of G . In this paper, we introduce bipartite transposition-like graphs, which are inductively constructed from lower ranked bipartite transposition-like graphs. We show that every rank n bipartite transposition-like graph G admit a paired ( n − 1 ) -to- ( n − 1 ) disjoint path cover for all choices of S = { s 1 , s 2 , … , s n − 1 } and T = { t 1 , t 2 , … , t n − 1 } , provided that S is in one partite set of G and T is in the other.