2n阶(n-2)-正则二部图的最小基本圈基

Minimum fundamental cycle basis of(n-2)-regular bipartite graphs with order 2n

设图G为2n阶(n-2)-正则二部图.构造了图G的一个基本圈基并且证明了此圈基就是图G的一个最小基本圈基,同时还确定了任意最小基本圈基对应的生成树的结构.

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.