摘要
V8是由一个圈C_8=v_1v_2v_3v_4v_5v_6v_7v_8v_1添加边v_1v_5,v_2v_6,v_3v_7,v_4v_8所得到的图,它是一个重要的3正则图.两个图的笛卡尔积的交叉数问题受到广泛的关注.运用数学归纳法证明了图V8与路Pn的笛卡尔积的交叉数是9n-1,其中n≥1.
V8 is a graph consisting of a cycle C8= v1 v2 v3 v4 v5 v6 v7 v8 v1 and the edges v1 v5, v2 v6, v3 v7, v4 v8, which is an important 3-regular graph. The problem of the crossing number of the Cartesian product of two graphs has attracted immense academic attention. The analysis showed the crossing number of the Cartesian product of a path Pnand V8 is9 n-1 for n≥1.
出处
《南通大学学报（自然科学版）》
CAS
2017年第3期79-85,共7页
Journal of Nantong University(Natural Science Edition)
基金
国家自然科学基金项目(11171114)
关键词
V8
交叉数
笛卡尔积
路
V8
crossing number
Cartesian product
path
