欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
V8是由一个圈C8=v1v2v3v4v5v6v7v8v1添加边v1v5,v2v6,v3v7,v4v8所得到的图,它是一个重要的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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：