%0 Journal Article
%T 2n阶(n-2)-正则二部图的最小基本圈基
%A 何常香
%A 刘伟龙
%J 华东师范大学学报(自然科学版)
%D 2016
%R 2016.02.008
%X 摘要 设图,G,为,2n,阶,(n-2)-,正则二部图.构造了图,G,的一个基本圈基并且证明了此圈基就是图,G,的一个最小基本圈基,同时还确定了任意最小基本圈基对应的生成树的结构</br>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.
%K 正则二部图
%K 图的圈基
%K 最小圈基
%K 最小基本圈基&lt
%K /br&gt
%K Key words： regular bipartite graph cycle basis of graph minimum cycle basis minimum fundamental cycle basis
%U http://xblk.ecnu.edu.cn/CN/abstract/abstract25283.shtml