Abstract: Let G be an (n-2)- regular bipartite graph with order 2n. In this paper, we constructed a fundamental cycle basis of G and proved this basis is a minimum fundamental cycle basis. For any minimum fundamental cycle basis, we also determined the structure of the spanning tree corresponding to it.

Key words: regular bipartite graph, cycle basis of graph, minimum cycle basis, minimum fundamental cycle basis