删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

mC3∨nC3和mC4∨nC4点可区别Ⅰ-全染色及Ⅵ-全染色

本站小编 Free考研考试/2024-01-16

-->
陈祥恩,张生桂.mC3∨nC3和mC4∨nC4点可区别Ⅰ-全染色及Ⅵ-全染色[J].,2020,60(1):107-110
mC3∨nC3和mC4∨nC4点可区别Ⅰ-全染色及Ⅵ-全染色
Vertex-distinguishingⅠ-total coloring and Ⅵ-total coloring ofmC3∨nC3 andmC4∨nC4
DOI:10.7511/dllgxb202001015
中文关键词:图的联Ⅰ-(Ⅵ-)全染色点可区别Ⅰ-(Ⅵ-)全染色点可区别Ⅰ-(Ⅵ-)全色数
英文关键词:join of graphsⅠ-(Ⅵ-) total coloringvertex-distinguishing Ⅰ-(Ⅵ-) total coloringvertex-distinguishing Ⅰ-(Ⅵ-) total chromatic number
基金项目:国家自然科学基金资助项目(1176106461163037);西北师范大学研究生科研资助项目(2019KYZZ012036).
作者单位
陈祥恩,张生桂
摘要点击次数:339
全文下载次数:399
中文摘要:
设f为简单图G的一个一般全染色(即若干种颜色对图G的全部顶点及边的一个分配),如果任意两个相邻点染以不同颜色且任意两条相邻边染以不同的颜色,则称为图G的Ⅰ-全染色;如果任意两条相邻边染以不同的颜色,则称为图G的Ⅵ-全染色.用C(x)表示在f下点x的颜色以及与x关联的边的色所构成的集合(非多重集).对图G的一个Ⅰ-全染色(分别地,Ⅵ-全染色)f,一旦u,v∈V(G),u≠v,就有C(u)≠C(v),则f称为图G的点可区别Ⅰ-全染色(或点可区别Ⅵ-全染色),简称为VDIT染色(分别地,VDVIT染色).令χⅠvt(G)=min{k|G存在k-VDIT染色},称χⅠvt(G)为图G的点可区别Ⅰ-全色数.令χⅥ vt(G)=min{k|G存在k-VDVIT染色},称χⅥvt(G)为图G的点可区别Ⅵ-全色数.利用构造具体染色的方法,讨论了联图mC3∨nC3和mC4∨nC4的点可区别Ⅰ-全染色和点可区别Ⅵ-全染色,并给出了联图mC3∨nC3和mC4∨nC4的点可区别Ⅰ-全色数和点可区别Ⅵ-全色数.
英文摘要:
Let Gbe a simple graph. Suppose fis a general total coloring of graph G(i.e., an assignment of several colors to all vertices and edges of G), if any two adjacent vertices and any two adjacent edges of graph Gare assigned different colors, then fis called an Ⅰ-total coloring of a graph G; if any two adjacent edges of Gare assigned different colors, thenf is called a Ⅵ-total coloring of a graph G. Let C(x) denote the set of colors of vertex x and of the edges incident with x under f, the set is non multiple set. For an Ⅰ-total coloring (resp., Ⅵ-total coloring) f of a graph G, if C(u)≠C(v) for any two distinct vertices u and v of V(G), then fis called a vertex-distinguishing Ⅰ-total coloring (resp., vertex-distinguishing Ⅵ-total coloring) of graph G, short for VDIT coloring (resp., VDVIT coloring). LetχⅠvt(G)=min{k|G has ak-VDIT coloring}, then χⅠvt(G) is called the VDIT chromatic number of graph G. Let χⅥ vt(G)=min{k|G has a k-VDVIT coloring}, then χⅥvt(G) is called the VDVIT chromatic number of graph G. The VDIT coloring (resp., VDVIT coloring) of mC3∨nC3 andmC4∨nC4are determined and the VDIT chromatic number (resp., VDVIT chromatic number) of them are determined by constructing concrete coloring.
查看全文查看/发表评论下载PDF阅读器
关闭
相关话题/

  • 领限时大额优惠券,享本站正版考研考试资料!
    大额优惠券
    优惠券领取后72小时内有效,10万种最新考研考试考证类电子打印资料任你选。涵盖全国500余所院校考研专业课、200多种职业资格考试、1100多种经典教材,产品类型包含电子书、题库、全套资料以及视频,无论您是考研复习、考证刷题,还是考前冲刺等,不同类型的产品可满足您学习上的不同需求。 ...
    本站小编 Free壹佰分学习网 2022-09-19