nav emailalert searchbtn searchbox tablepage yinyongbenwen piczone journalimg journalInfo journalinfonormal searchdiv searchzone qikanlogo popupnotification paper paperNew
2025, 06, v.42 101-106
路图和圈图的D(β)-点和可区别全染色
基金项目(Foundation): 国家自然科学基金项目(61962035)
邮箱(Email): qhy2005ww@126.com;
DOI: 10.13486/j.issn.2097-4973.2025.06.013
摘要:

应用构造染色法、组合分析法研究了路图中任意两点距离不超过4与5,以及圈图中任意两点的距离不超过β(3≤β≤5)的两类点和可区别全染色问题,得到了这两类图相应的D(β)-点和可区别全色数。

Abstract:

This paper studies vertex sum distinguishing total coloring problems of any two points with a distance of no more than 4 and 5 in the path graphs and the problem of vertex and distinguishing total coloring with a distance of no more thanβ(3≤β≤5)from any two points in the cycle graphs by using constructing coloring function and combination analytic method,and has obtained the D(β)-vertex sum distinguishing total chromatic numbers of these two types of graphs.

参考文献

[1]张忠辅,李敬文,陈祥恩,等.图的距离不大于β的点可区别的全染色[J].中国科学(A辑:数学),2006,36(10):1119-1130.

[2]PILS'NIAK M,WOZ'NIAK M.On the total-neighbor-distinguishing index by sums[J].Graphs and combinatorics,2015,31(3):771-782.

[3]袁清厚.随机图的D(β)-点和可区别全染色算法的研究[D].兰州:兰州交通大学,2021.

[4]何静,强会英.圈图与简单图的冠图的D(2)-点和可区别边染色的界[J].吉林大学学报(理学版),2025,63(2):375-381.

[5]刘欢,强会英,王洪申.单圈图的D(2)-点和可区别边染色[J].南开大学学报(自然科学版),2024,57(1):91-97.

[6]姚丽.几类图的2-距离和可区别染色[D].兰州:兰州交通大学,2021.

[7]ZHOU L M,LI J W,WANG B M.A new algorithm for D(β)-vertices sum distinguishing edge coloring of graphs[C]//2021IEEE 4th Advanced Information Management,Communicates,Electronic and Automation Control Conference(IMCEC).Chongqing,China:IEEE,2021:159-164.

[8]张东翰,朱白.路的D(3)-点可区别的全染色[J].商洛学院学报,2014,28(2):11-12.

[9]YAO J J,YU X W,WANG G H,et al.Neighbor sum distinguishing total coloring of 2-degenerate graphs[J].Journal of combinatorial optimization,2017,34(1):64-70.

[10]YU X W,WANG G H,WU J L,et al.Neighbor sum distinguishing edge coloring of subcubic graphs[J].Acta mathematica sinica,2017,33(2):252-262.

[11]LIU X S,XHU Z Q.Upper bound on the D(β)-vertex-distinguishing total-chromatic number of graphs[J].ARS combinatoria,2015,119:403-411.

[12]FLANDRIN E,MARCZYK A,PRZYBYLO J,et al.Neighbor sum distinguishing index[J].Graphs and combinatorics,2013,29(5):1329-1336.

[13]杨笑蕊,强会英,李雨虹.两类冠图的邻和可区别全染色[J].兰州交通大学学报,2019,38(5):114-117.

基本信息:

DOI:10.13486/j.issn.2097-4973.2025.06.013

中图分类号:O157.5

引用信息:

[1]马倩倩,强会英.路图和圈图的D(β)-点和可区别全染色[J].山东航空学院学报,2025,42(06):101-106.DOI:10.13486/j.issn.2097-4973.2025.06.013.

基金信息:

国家自然科学基金项目(61962035)

发布时间:

2025-12-15

出版时间:

2025-12-15

检 索 高级检索

引用

GB/T 7714-2015 格式引文
MLA格式引文
APA格式引文