【摘要】 轮Wr+1(r≥3)是一个r阶圈加上一个新的顶点,再把圈上每个顶点与新顶点连上边所得到的图.新顶点与圈上顶点之间的边称为辐边,圈上的边称为边缘边.所谓花图Fr,m,n(r≥3,m≥1,n≥2m+1),是在轮Wr+1中的在每条辐边上分别嵌入m-1个新点,在每条边缘边上分别嵌入n-2m-1个新点所得到的图.所谓棱柱Qn(n≥3),是指Qn=(V,E),V={u1,u2,…,un}∪{v1,v2,…,vn},E={uiui+1,vivi+1,uivi,uivi+1|i=1,2,…,n},其中un+1=u1,vn+1=v1.通过给出花图Fr,m,n(r≥3,m≥1,n≥2m+1)和棱柱Qn(n≥3)的一种关联着色方法,确定了它们的关联色数.更多还原

【Abstract】 A wheel W_r+1（r≥3） is a graph obtained from a cycle of order r by adding a new vertex and joining the new vertex to all the vertices on the cycle. The new edges between the new vertex and the vertices on the cycle are called spoke edges,the edges on the cycle are called rim edges.A flower graph F_r,m,n（r≥3,m≥1,n≥2m+1） is a graph obtained from W_r+1 by inserting m-1 new vertices in every spoke edge and n-2m-1 new vertices in every rim edge.The planar graph Q_n（n≥3） called a prism is defined by Q_n=G（V,E）,V={u₁,u₂,…,u_n}∪{v₁,v₂,…,v_n} and E={u_iu_i+1,\ v_iv_i+1,u_iv_i,u_iv_i+1|i=1,2,…,n},where u_n+1=u₁,v_n+1=v₁.Based on incidence coloring methods of F_r,m,n（r≥3,m≥1,n≥2m+1） and Q_n（n≥3）,the incidence coloring numbers of them are determined.更多还原