K_m与P_n的直积的交叉数
发布时间：2018-12-18 02:25
【摘要】：在图G_1和G_2的直积图的所有画法中交叉点数最少的画法所含的交叉点的数目称为该图的交叉数,记作Cr(G_1×G_2).本文给出了完全图K_m与路_Pm的直积K_m×P_m的交叉数的上界和下界,即m~2n-m~2-2 mn+4≤Cr(K_m×P_m)≤(m~4-6m~3+11m~2-6m)(n-1)/6,并且确定了两个准确值:Cr(K_3×P_n)=0,Cr(K_4×P_3)=4.
[Abstract]:The number of crossover points in all the drawing methods of the direct product graphs of G _ S _ 1 and G _ S _ 2 is called the crossing number of the graph, which is recorded as Cr (G _ S _ 1 脳 G _ 2). In this paper, we give the upper and lower bounds of the cross number of K _ S _ m and path _ Pm, that is, m~2n-m~2-2 mn _ 4 鈮，
本文编号：2385165
[Abstract]:The number of crossover points in all the drawing methods of the direct product graphs of G _ S _ 1 and G _ S _ 2 is called the crossing number of the graph, which is recorded as Cr (G _ S _ 1 脳 G _ 2). In this paper, we give the upper and lower bounds of the cross number of K _ S _ m and path _ Pm, that is, m~2n-m~2-2 mn _ 4 鈮，
本文编号：2385165
本文链接：https://www.wllwen.com/kejilunwen/yysx/2385165.html
