摘要
目前已经确定的两个图的联图的交叉数结果比较少,为此讨论了五阶图G18分别与nK1, Pn的联图的交叉数,得到了cr(G18+nK1)=Z(5,n)+n+[n/2],n≥1;cr(G18+Pn)=Z(5,n)+n+[n/2]+2,n≥2.其中nK1是n个孤立点构成的图,Pn是含n个点的路.
Few results are known on the crossing numbers of join product of two graphs. In this paper, the crossing numbers of G18＋nK1 and G18＋Pn are proved, which are cr（G18＋nK1）=Z（5,n）＋n＋[n/2],n≥i;cr（G18＋Pn）=Z（5,n）＋n＋[n＋2,n≥2. In the paper, nKtconsists on n isolated vertices and P is the path on n vertices.
出处
《湖北文理学院学报》
2013年第11期15-17,66,共4页
Journal of Hubei University of Arts and Science
基金
湖北省自然科学基金项目(2012FFC053)
关键词
联图
画法
交叉数
路
Join
Drawing
Crossing number
Path
