摘要
联图G∨H表示将G中每个点与H中的每个点连边得到的图.在Klesc M给出所有3阶图和4阶图与圈n C联图的交叉数的基础上,利用反证法和排除法确定了1 2 3G,G,G三个5-阶图与圈n C联图的交叉数,他们的交叉数分别是cr(G1∨Cn)=Z(5,n)+2「n/2」+2,cr(G2∨Cn)=Z(5,n)+2「n/2」+2,cr(G3∨Cn)=Z(5,n)+2「n/2」+3.
By connecting each vertex of a graph G to each vertex of a graph H, a join graph, denoted by G ∨ H, was obtained. Based on the crossing number of join products of all 3-vertex and 4-vertex graphs with Cn by Klesc M, the crossing number of join products of three 5-vertex graphs was gotten with cycle Cn by reduction to absurdity and elimination method, which were cr（G1∨C2）=Z（5,n）＋2[n/2]＋2,cr（G2∨Cn）=Z（5,n）＋2[n/2]＋2,cr（G3∨Cn）=Z（5,n）＋2[n/2]＋3,respectively.
出处
《湖南文理学院学报（自然科学版）》
CAS
2013年第4期1-7,共7页
Journal of Hunan University of Arts and Science(Science and Technology)
基金
国家自然科学基金资助项目(11371133)
关键词
画法
交叉数
联图
圈
drawing
crossing number
join graph
cycle
