中文摘要：

图的交叉数是图论中-个重要的研究课题.分别记含有n＋1个顶点的树和路为7;与/通过数学归纳法验证并计算得到了笛卡尔积图Tn×Pm的交叉数,其中n≤4.

英文摘要：

The enumeration problem of the crossing number in graphs is an important research subject. Let Tm and Pm be a tree and a path with n ＋1 vertices, respectively. In this paper, we determine the crossing numbers of Cartesian product of circle graph Pm with some tree graphs Tn（ n≤4） by mathematical induction.