Marcus, A., Spielman, D.A., Srivastava, N [24] and Lubotzky, Phillips and Sarnak [22] presented the first explicit constructions of infinite families of Ramanujan graphs. These had degrees p + 1, for primes p. There have been a few other explicit constructions, presented by Friedman, J [18], all of which produce graphs of degree q + 1 for some prime power q. Gunnells, P [19] has proved that the existence of infinite families of bipartite Ramanujan of every degree. While today's proof of existence does not lend itself to an explicit construction, it is easier to understand than the presently known explicit constructions. In this article, author tries to present, interestingly express developments of an endless group of unequal Ramanujan bipartite graphs. Furthermore, author reconstruct to a portion of the known techniques for developing Ramanujan bipartite graphs and examine the computational work expected in really carrying out the different and recent development techniques.