这篇文章中,我们分两种情形分别给出了计算两个不交图的联图的最小圈基长度的公式.作为它们的应用,我们给出了计算n个相同的图的联圈以及完全r-部图等图的最小圈基长度的公式.
Minimum cycle base of a graph which is the join of two disjoint graphs is discussed according to two cases,and the corresponding formula for length of minimum cycle base of each case is given.As applications of two formulae,it gives formulae for lengths of minimum cycle bases of some special graphs,such as the graph which is the join n isomorphic graphs and the complete r-partite graph,etc.