Given a bipartite graph G = (A(1), A(2), E) with m := min {vertical bar A(1)vertical bar, |vertical bar A(2)vertical bar} >= 2, the edge prorating number for x is an element of A(i) is defined as rho(G)(x) = (d(x) - 1)/vertical bar A(3-i)vertical bar, i = 1, 2. Set.(G) := min {rho(G)(x): x is an element of A(1) boolean OR A(2)} and call it the minimum edge prorating number of G. We call G path two bipancyclic if for every path P of length two in G, and for every integer k is an element of [2, m], G has a 2k-cycle passing through P. In this article, it is shown that the minimum edge prorating n...
