Adjacent vertex-distinguishing I-total chromatic number of some  kinds of  k-multi-Mycielski graph

Abstract

Abstract: According to the properties of the k-multi-Mycielski graph[Mn(Sm)] and [Mn(Cm)],[Mn(Pm)], the adjacent vertex-distinguishing I-total coloring of some kinds of k-multi-Mycielski graph[Mn(Sm)] and [Mn(Cm)],[Mn(Pm)] have been discussed. The adjacent vertex distinguishing I-total chromatic number of [Mn(Sm)] and [Mn(Cm)],[Mn(Pm)] has been obtained. And the coloring method of the k-multi-Mycielski graph [Mn(Sm)] and [Mn(Cm)],[Mn(Pm)] has been given.

Key words: graph, star, path, circle, k-multi-Mycielski graph, adjacent vertex distinguishing I-total coloring, adjacent vertex distinguishing I-total chromatic number

摘要： 根据路和星、圈的多重Mycielski图的结构性质，用穷染递推的方法，讨论了图[Mn(Cm)]和[Mn(Pm)]，以及[Mn(Sm)]的邻点可区别I-全染色，得到了图[Mn(Sm)]和[Mn(Pm)]的邻点可区别I-全色数等于它们的最大度，图[Mn(Cm)]的邻点可区别I-全色数在m=4，5时等于它的最大度加1，其余情况等于它的最大度，即分别给出图[Mn(Sm)]和[Mn(Cm)、][Mn(Pm)]一种染色方案。

关键词: 图, 星, 路, 圈, 多重Mycielski图, 邻点可区别I-全染色, 邻点可区别I-全色数

TIAN Jingjing. Adjacent vertex-distinguishing I-total chromatic number of some kinds of k-multi-Mycielski graph[J]. Computer Engineering and Applications, 2012, 48(25): 39-41.

田京京. 若干多重Mycielski图的邻点可区别I-全色数[J]. 计算机工程与应用, 2012, 48(25): 39-41.

[1]	WU Wenjie, SONG Wen’ai, GAO Xuemei, YANG Jijiang, WANG Qing, HUANG Liping, LEI Yi. Review of X-Ray-Based Computer-Aided Diagnosis of Adult OSA [J]. Computer Engineering and Applications, 2021, 57(9): 1-8.
[2]	JIA Xiang’en, DONG Yihong, ZHU Feng, QIAN Jiangbo. Research Progress of Heterogeneous Graph Convolutional Networks [J]. Computer Engineering and Applications, 2021, 57(9): 36-49.
[3]	KONG Jili, ZHANG Pengkun, LIU Xiaoping. Research on Improved A* Algorithm of Bidirectional Search Mechanism [J]. Computer Engineering and Applications, 2021, 57(8): 231-237.
[4]	HUAI Chuangfeng, GUO Long, JIA Xueyan, ZHANG Zihao. Improved A* Algorithm and Dynamic Window Method for Robot Dynamic Path Planning [J]. Computer Engineering and Applications, 2021, 57(8): 244-248.
[5]	LI Jun. Improved Social Force Crowd Evacuation Simulation Model Combined with Shortest Path [J]. Computer Engineering and Applications, 2021, 57(8): 264-270.
[6]	ZHAI Zhengli, LI Penghui, FENG Shu. Research Overview of Adversarial Attacks on Graphs [J]. Computer Engineering and Applications, 2021, 57(7): 14-21.
[7]	LIAO Liefa, LI Haohan, LI Shuai, ZHU Helong, LI Zhijun. Research on Control Strategy of Soccer Robot Combined with Winner-Take-All [J]. Computer Engineering and Applications, 2021, 57(7): 136-143.
[8]	ZHANG Dieyi, YIN Lijie. Clustering-Preserving Representation Learning on Heterogeneous Network [J]. Computer Engineering and Applications, 2021, 57(7): 144-150.
[9]	HAN Xiaowei, HAN Zhen, YUE Gaofeng, CUI Jianjiang. Path Planning Algorithm of Disaster Relief UAV Based on Optimized A [J]. Computer Engineering and Applications, 2021, 57(6): 232-238.
[10]	ZHU Jiaying, GAO Maoting. AUV Path Planning Based on Particle Swarm Optimization and Improved Ant Colony Optimization [J]. Computer Engineering and Applications, 2021, 57(6): 267-273.
[11]	LIU Jianyu, FAN Pingqing. Path Planning of Manipulator Based on Improved RRT*-connect Algorithm [J]. Computer Engineering and Applications, 2021, 57(6): 274-278.
[12]	HU Wei’an, ZOU Junzhong, GUO Yucheng, ZHANG Jian, WANG Bei. Lesion Recognition Method of Pathological Images Based on Multidimensional Features [J]. Computer Engineering and Applications, 2021, 57(6): 144-151.
[13]	WANG Di, LI Caihong, GUO Na, LIU Guoming, GAO Tengteng. Local Path Planning of Mobile Robot Based on Fuzzy Potential Field Method [J]. Computer Engineering and Applications, 2021, 57(6): 212-218.
[14]	JIANG Lin, FANG Dongjun, LEI Bin, LI Weigang. Research Status and Trend of Navigation Algorithm for Mobile Robot with Monocular Vision [J]. Computer Engineering and Applications, 2021, 57(5): 1-9.
[15]	ZHENG Kun, KONG Jiangping, ZHOU Jing, CI Kangyi, CHANG Peng. Review of iPPG and Application of Physiological Parameter Detection in Education [J]. Computer Engineering and Applications, 2021, 57(5): 25-35.

Adjacent vertex-distinguishing I-total chromatic number of some kinds of k-multi-Mycielski graph

若干多重Mycielski图的邻点可区别I-全色数

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics