关于路的k-方图的邻点可区别-边全染色和第一类弱全染色

Adjacent-vertex-distinguishing-edge Total Coloring and the First Weak Total Coloring of k-cube Graph of Path

下载PDF

导出

摘要给出了路的k-方图的邻点可区别-边全染色数和第一类弱全染色数。 The adjacent-vertex-distinguishing-edge total chromatic number and the first weak total chromatic number of k-cube graph of path Pn are given.

作者严谦泰 YAN Qiantai(School of Mathematics and Statistics,Anyang Normal University,Anyang 455000,China)

机构地区安阳师范学院数学与统计学院

出处《安阳师范学院学报》 2021年第2期1-3,共3页 Journal of Anyang Normal University

基金河南省自然科学基金(项目编号0511013800) 河南省高校重点科研项目(项目编号19B110004)。

关键词邻点可区别-边全染色第一类弱全染色邻点可区别-边全染色数第一类弱全染色数 k-方图 adjacent-vertex-distinguishing-edge total coloring the first weak total coloring adjacent-vertex-distinguishing-edge total chromatic number the first weak total chromatic number k-cube graph

分类号 O157.5 [理学—数学]

引文网络
相关文献

参考文献2

1ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量：175
2李沐春,强会英,张忠辅.若干联图的邻点可区别E-全染色[J].兰州理工大学学报,2009,35(2):158-161. 被引量：1

二级参考文献8

1ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量：175
2张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学（A辑）,2004,34(5):574-583. 被引量：192
3陈祥恩,张忠辅.Adjacent-Vertex-Distinguishing Total Chromatic Number of P_m×K_n[J].Journal of Mathematical Research and Exposition,2006,26(3):489-494. 被引量：16
4ZHANG Zhongfu,QIU Pengxiang, XU Baogen, et al. Vertexdistinguishing total coloring of graphs [J]. Ars Combinatoria, 2008,87:33-45. 被引量：1
5BONDY J A,MURTY U S R Graph theory with applications [M]. New York: The Macmillan Press LTD, 1976. 被引量：1
6ZHANG Zhongfu, DOUGLAS R W, YAO Bing, et al. Adjacent vertex-distinguishing E-total coloring of graphs [EB/OL]. (2008-06-12) [ 2008-07-24 ] http://202. 201. 18. 40: 8080/ mas5/. 被引量：1
7Bums,A. C,Schelp,R. H.Vertex-distinguishing proper edge-colorings, J[].of Graph Theory.1997 被引量：1
8李沐春,强会英,晁福刚,张忠辅.完全二部图广义Mycielski图的邻点可区别全色数与邻强边色数[J].数学的实践与认识,2008,38(19):147-152. 被引量：15

共引文献174

1朱恩强,吕新忠,张玉红.关于C_m·C_n,C_m·S_n和C_m·K_n的邻点可区别全色数[J].江西师范大学学报（自然科学版）,2008,32(4):403-407.
2陈祥恩,张忠辅,孙宜蓉.A Note on Adjacent-Vertex-Distinguishing Total Chromatic Numbers for P_m × P_n,P_m × C_n and C_m × C_n[J].Journal of Mathematical Research and Exposition,2008,28(4):789-798. 被引量：1
3李沐春,胡超,张忠辅.奇圈、偶圈与轮的多重联图的邻点可区别E-全染色(英文)[J].郑州大学学报（理学版）,2009,41(2):1-6.
4ZHANG Zhongfu,LI Jingwen,CHEN Xiang’en,YAO Bing, WANG Wenjie & QIU Pengxiang Institute of Applied Mathematic, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China.D(β)-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2006,49(10):1430-1440. 被引量：56
5Dong Wei,Xu BaoGang,Zhang XiaoYan.Improved bounds on linear coloring of plane graphs[J].Science China Mathematics,2010,53(7):1891-1898. 被引量：4
6WOODALL Douglas R.Adjacent strong edge colorings and total colorings of regular graphs[J].Science China Mathematics,2009,52(5):973-980. 被引量：10
7ZHANG ZhongFu,CHENG Hui,YAO Bing,LI JingWen,CHEN XiangEn,XU BaoGen.On the adjacent-vertex-strongly-distinguishing total coloring of graphs[J].Science China Mathematics,2008,51(3):427-436. 被引量：79
8陈祥恩,张忠辅.关于图K_(2n+1)-E(2K_2)的邻点可区别全色数[J].兰州大学学报（自然科学版）,2005,41(6):102-105. 被引量：12
9李光海,李武装.关于几类图的邻点可区别全染色[J].河南师范大学学报（自然科学版）,2006,34(1):139-140. 被引量：5
10陈祥恩,张忠辅.Adjacent-Vertex-Distinguishing Total Chromatic Number of P_m×K_n[J].Journal of Mathematical Research and Exposition,2006,26(3):489-494. 被引量：16

1马静静,陈祥恩.K4,4,p的点可区别的IE-全染色(4≤p≤1007)[J].中山大学学报（自然科学版）,2020,59(4):134-143. 被引量：2
2安卓莫,田双亮,蔡瑾.路的强积的邻点可区别边染色[J].西北民族大学学报（自然科学版）,2020,41(4):7-10. 被引量：2
3熊雪玮,刘培江,王浩华.图的k-全染色问题与Gr?bner基求解[J].数学理论与应用,2019(2):20-31.
4陈祥恩,马静静.K4,4,p的点可区别的IE-全染色(p≥1008)[J].电子与信息学报,2020,42(12):3068-3073. 被引量：3
5杨随义.T-型六角系统的邻点可区别I-全色数[J].天水师范学院学报,2020,40(5):19-21.

安阳师范学院学报

2021年第2期

浏览历史

内容加载中请稍等...

关于路的k-方图的邻点可区别-边全染色和第一类弱全染色

参考文献2

二级参考文献8

共引文献174

相关作者

相关机构

相关主题

浏览历史