摘要
C(7,2)表示由圈C_7(v_1v_2…v_7v_1)增加边v_iv_i+2(i=1,2,…7,i+2(mod 7))所得的循环图.目前没有有关七阶图与路、星和圈的笛卡尔积交叉数的结果,我们证明了7阶循环图C(7,2)与路P_n的笛卡儿积的交叉数是8n.
C(7, 2) is a circulant graph obtained from CT(v1v2… v7v1) by adding edges viv+2(i = 1, 2, …, n,i + 2(rood 7)). There is no results of the crossing numbers of Cartesianproducts of paths with the circulant graphs having more than six vertices. We have proved that the crossing number of cartesian product of Pn with circulant graph C(7, 2) is 8n.
出处
《数学进展》
CSCD
北大核心
2008年第2期245-253,共9页
Advances in Mathematics(China)
基金
湖南省教育厅重点资助项目(N0.05A037)湖南省自然科学基金资助项目(No.06JJ2053)
关键词
画法
交叉数
C(7
2)
笛卡尔积
同胚
PN
drawing
crossing number
C(7, 2)
Cartesian product
P.,
homeomorphism