摘要
确定图的交叉数是NP-complete问题,现有的关于联图的交叉数的结果比较少,为此,讨论了五阶图4G分别与nK1,Pn及Cn的联图的交叉数.
The investigation on the crossing number of graphs is a NP-complete problem.There are only few results about crossing numbers of graphs obtained as join product of two graphs.In this paper,we study the crossing numbers of the join products G4＋nK,G4＋Pn and G4＋Cn for the graphs G4 of order five.
出处
《湖北文理学院学报》
2012年第11期11-14,共4页
Journal of Hubei University of Arts and Science
基金
湖北省自然科学基金项目(2012FFC05301)
关键词
交叉数
联图
画法
路
圈
Crossing number
Join
Drawing
Path
Cycle
