图的边集亏数的插值定理

An Interpolation Theorem on the Sub-edge-set’s Deficiency

类似于最大亏格计算公式中的Betti亏数的计算方法,利用Nebesky给出的Betti亏数的计算公式,证明了图G的边集亏数ξ(G,A)的内插定理,推广了已有的结果.

This paper first investigates an interpolation theorem on the number of odd components of co-tree in a connected graph according to the calculation method of Betti deficiency of a graph. Then it gives another interpolation theorem on sub-edge-set＇s deficiency according to the equation of Betti deficiency given by Nebesky and generalizes the already known results.