两类图的幂图的联结数

The Binding Number of the Powers of Path and Circuit

本文给出了路与圈的任意k次幂图(k≥2)的联结数的计算公式,并给出了证明。

Let P_n be a path with n vertices,C_n be a circuit with n vertices.P_n^k and C_n^k denote the k — th Powers of P_n and C_n respectively. In this Paper, the following results on the binding number of P_n^k and C_n^k are presented and proved: bind■ bind■ where k≥2