给出树和轮的全联结数的计算公式。
The calculated formulas of total binding number for the tree and the wheel are given.
研究了图有分数因子的联结数和最小度条件。
Binding number and minimum degree conditions for a graph to have fractional factors are studied.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理,并给出了若干多重乘积图的联结数的极限性质。
In this paper, a theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
应用推荐