完全二部图K10,n(10≤n≤90)的点可区别E-全染色

doi:10.6040/j.issn.1671-9352.0.2018.605

《山东大学学报(理学版)》 ›› 2018, Vol. 53 ›› Issue (12): 23-30.doi: 10.6040/j.issn.1671-9352.0.2018.605

完全二部图K10,n(10≤n≤90)的点可区别E-全染色

包丽娅¹,陈祥恩¹,王治文²

1.西北师范大学数学与统计学院, 甘肃兰州 730070;2.宁夏大学数学统计学院, 宁厦银川 750021

出版日期:2018-12-20 发布日期:2018-12-18
作者简介:包丽娅(1993— ),女,硕士研究生,研究方向为图论及其应用. E-mail:baoliya20170820bly@163.com
基金资助:
国家自然科学基金资助项目(11761064,61163037,11261046);宁夏自然科学基金资助项目(2018AAC03005);宁夏回族自治区百人计划资助项目

Vertex-distinguishing E-total coloring of complete bipartite graph K10,n with 10≤n≤90

1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, Gansu, China;
2. College of Mathematics and Statistics, Ningxia University, Yinchuan 750021, Ningxia, China

Online:2018-12-20 Published:2018-12-18

摘要/Abstract

摘要： 图G的一个E-全染色f是指使相邻点染以不同颜色且每条关联边与它的端点染以不同颜色的全染色。对图G的一个E-全染色f,一旦∠u,v∈V(G), u≠v,就有C(u)≠C(v),其中C(x)表示在f下点x的颜色以及与x关联的边的色所构成的集合,则f称为图G的点可区别的E-全染色,简称为VDET染色。令χ^e_vt(G)=min{k|G存在k-VDET染色},称χ^e_vt(G)为图G的点可区别E-全色数。利用分析法和反证法,讨论并给出了完全二部图K_10,n(10≤n≤90)的点可区别E-全色数。

关键词: 完全二部图, E-全染色, 点可区别E-全染色, 点可区别E-全色数

Abstract: Let G be a simple graph. An E-total coloring f of G is called that if there are no two adjacent vertices of G receive the same color, and no edges of G receives the same color as one of its endpoints. For an E-total coloring f of G, if C(u)≠C(v) for any two distinct vertices u and v of V(G), where C(x) denotes the set of colors of vertex x and of the edges incident with x under f, then f is called a vertex-distinguishing E-total coloring of G. Let χ^e_vt(G)=min{k|G has a k-VDET coloring}. Then χ^e_vt(G) is called the VDET chromatic number of G. By using analytical method and proof by contradiction, the VDET coloring of complete bipartite graph K10,n is discussed and the VDET chromatic number of K10,n(10≤n≤90) has been obtained.

Key words: complete bipartite graphs, E-total coloring, vertex-distinguishing E-total coloring, vertex-distinguishing E-total chromatic number

中图分类号:

O157.5

包丽娅,陈祥恩,王治文. 完全二部图K10,n(10≤n≤90)的点可区别E-全染色[J]. 《山东大学学报(理学版)》, 2018, 53(12): 23-30.

参考文献

[1] ZHANG Zhongfu, QIU Pengxiang, LI Jingwen, et al. Vertex-distinguishing total colorings of graphs[J]. Ars Combinatoria, 2008, 87:33-45.
[2] CHEN Xiangen, GAO Yuping, YAO Bing. Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph[J]. Information Sciences, 2014, 288:246-253.
[3] 辛小青, 王治文, 陈祥恩, 等. 点不交的m个C3的并的点可区别全染色[J]. 吉林大学学报(理学版), 2012, 50(2):251-257. XIN Xiaoqing, WANG Zhiwen, CHEN Xiangen, et al. Vertex-distinguishing total chromatic number of mC3[J]. Journal of Jilin University(Science Edition), 2012, 50(2):251-257.
[4] 陈祥恩, 王治文, 马彦荣, 等. mK4的点可区别全染色[J]. 吉林大学学报(理学版), 2012, 50(4):686-692. CHEN Xiangen, WANG Zhiwen, MA Yanrong, et al. Vertex-distinguishing total colorings of mK4[J]. Journal of Jilin University(Science Edition), 2012, 50(4):686-692.
[5] CHEN Xiangen, ZU Yue, ZHANG Zhongfu. Vertex-distinguishing E-total colorings of graphs[J]. Arab J Sci Eng, 2011, 36:1485-1500.
[6] CHEN Xiangen, ZU Yue. Vertex-distinguishing E-total coloring of the graphs mC3 and mC4[J]. Journal of Mathematical Research & Exposition, 2011, 31:45-58.
[7] 李世玲, 陈祥恩, 王治文. 完全二部图K3,n(3≤n≤17)的点可区别E-全染色[J]. 吉林大学学报(理学版), 2015, 53(6):1171-1176. LI Shiling, CHEN Xiangen,WANG Zhiwen. Vertex-distinguishing E-total coloring of complete bipartite graph K3,n when 3≤n≤17[J]. Journal of Jilin University(Science Edition), 2015, 53(6):1171-176.
[8] 李世玲, 陈祥恩, 王治文. 完全二部图K3,n(n≥18)的点可区别E-全染色[J]. 山东大学学报(理学版), 2015, 51(4):68-71. LI Shiling, CHEN Xiangen, WANG Zhiwen. Vertex-distinguishing E-total coloring of complete bipartite graph K3,n when n≥18[J]. Journal of Shandong University(Nature Science), 2015, 51(4):68-71.
[9] 李世玲. 完全二部图的点可区别E-全染色的若干结果[D]. 兰州:西北师范大学, 2017. LI Shiling. Some results of Vertex-distinguishing E-total coloring of complete bipartite graph[D]. Lanzhou: Northwest Normal University, 2017.
[10] CHEN Xiangen. Vertex-distinguishing E-total coloring of complete bipartite graph K7,n when 7≤n≤95[J]. Communications in Mathematical Research, 2016, 32(4):359-374.

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed

完全二部图K10,n(10≤n≤90)的点可区别E-全染色

Vertex-distinguishing E-total coloring of complete bipartite graph K10,n with 10≤n≤90

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 10

多维度评价

本文评价

推荐阅读 0

[1]	郭亚勤,陈祥恩. 完全二部图K1,n、K2,n、K3,n的点被多重集可区别的E-全染色[J]. 《山东大学学报(理学版)》, 2025, 60(2): 24-33.
[2]	胡开洋,黄明芳,马宝林. 完全二部图K_{12, n}(12≤n≤88)的点可区别E-全染色[J]. 《山东大学学报(理学版)》, 2024, 59(6): 36-43, 70.
[3]	曹静,陈祥恩. 轮与扇的点被多重集可区别的E-全染色[J]. 《山东大学学报(理学版)》, 2024, 59(2): 38-46.
[4]	索孟鸽,陈京荣,张娟敏. 笛卡尔乘积图的k-路点覆盖[J]. 《山东大学学报(理学版)》, 2022, 57(12): 103-110.
[5]	寇艳芳,陈祥恩,王治文. K1,3,p和 K1,4,p的点可区别的IE-全染色及一般全染色[J]. 山东大学学报（理学版）, 2018, 53(8): 53-60.
[6]	李世玲, 陈祥恩,王治文. 完全二部图K3,n(n≥18)的点可区别E-全染色[J]. 山东大学学报（理学版）, 2016, 51(4): 68-71.
[7]	刘信生, 邓卫东, 王志强. 直积图邻点可区别E-全染色的一些结论[J]. 山东大学学报（理学版）, 2015, 50(02): 5-8.
[8]	李振琳,卢君龙,吕新忠. 关于图的符号边全控制[J]. J4, 2012, 47(6): 83-86.
[9]	王国兴. 点不交的m个C₃的并的点可区别IE-全染色[J]. J4, 2011, 46(2): 57-61.
[10]	何文玉，陈祥恩*. 完全二部图K5,n的点可区别IE全染色[J]. J4, 2009, 44(2): 91-96.