Perfect　state　transfer　has　attracted　a　great　deal　of　attention　recently　due　to　its　crucial　role　in　quantum　communication　and　scalable　quantum　computation.　In　this　paper,　we　propose　the　perfect　state　transfer　algorithms　with　a　pair　of　sender-receiver　and　two　pairs　of　sender-receiver　on　the　complete　bipartite　graph　respectively.　The　algorithm　with　a　pair　of　sender-receiver　is　implemented　through　discrete-time　quantum　walk,　flexibly　setting　the　coin　operators　based　on　the　positions　of　the　sender　and　receiver.　The　algorithm　with　two　pairs　of　sender-receiver　ensures　that　the　two　quantum　states　are　distributed　on　both　sides　of　the　complete　bipartite　graph　during　the　process,　thereby　achieving　perfect　state　transfer.　In　addition,　the　quantum　circuits　corresponding　to　the　algorithms　are　provided.　The　algorithms　can　transfer　an　arbitrary　quantum　state　and　can　simultaneously　transfer　two　arbitrary　quantum　states　from　the　senders　to　the　receivers　in　any　case.　Moreover,　the　algorithms　are　not　only　applicable　to　complete　bipartite　graphs　but　also　to　more　graph　structures　with　complete　bipartite　subgraphs,　which　will　provide　potential　applications　for　quantum　information　processing.