/manager/Index ${session.getAttribute("locale")} 5 Transmuted generalized Gompertz distribution with application /manager/Repository/uon:32967 Mon 23 Sep 2019 12:04:45 AEST ]]> An algorithm for the orientation of complete bipartite graphs /manager/Repository/uon:32495 G be a graph with vertex set V(G) and edge set E(G). We consider the problem of orienting the edges of a complete bipartite graph Kn,n so only two different in-degrees a and b occur. An obvious necessary condition for orienting the edges of G so that only two in-degrees a and b occur, is that there exist positive integers s and t satisfying s+t=|V(G)| and as+bt=|V(G)|. In this paper, we show that the necessary condition is also sufficient for a complete bipartite graph Kn,n. Furthermore, we give the algorithms of orientations with only two in-degrees of Kn,n.]]> Mon 23 Sep 2019 11:31:42 AEST ]]>