摘要
图G的一个圈基的长度是该圈基的所有圈的长度之和.设C－、Ｃ+分别是Ｇ的最小、最大圈基长度，如果对任一Ｃ∈Ｎ，Ｃ－<C<C+，都存在Ｇ的一个长为Ｃ的圈基，则称Ｇ具有圈基内插性质．本文证明了，完全图Kn具有圈基内插性质。
The length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let C－、C+ be the minimum and maximum length of cycle basis respectively. Then G has the cycle basis interpolation property(Cbip) if for any integer C,C－<C<C+, there exists a cycle basis with length C.In this paper we pjrove that complete graph Kn has the Cbip.
出处
《漳州师范学院学报（自然科学版）》
2000年第4期7-10,20,共5页
Journal of ZhangZhou Teachers College（Natural Science)
