若干Mycielski's图的邻点可区别E-全染色 |
| |
引用本文: | 李沐春,王双利,凌昭昭,张忠辅.若干Mycielski's图的邻点可区别E-全染色[J].数学的实践与认识,2014(4). |
| |
作者姓名: | 李沐春 王双利 凌昭昭 张忠辅 |
| |
作者单位: | 兰州交通大学数理与软件工程学院; |
| |
基金项目: | 国家自然科学基金(11061017);甘肃省自然科学基金(1212RJZA039);甘肃省硕导基金(1104-10) |
| |
摘 要: | 针对简单图G与Mycielski's图之间的关系,讨论了路、圈、星、扇、轮和完全图的Mycielski's图的邻点可区别E-全染色,给出了路、圈、星、扇、轮和完全图的Mycielski's图的邻点可区别E-全色数.
|
关 键 词: | Mycielski's图 邻点可区别E-全染色 邻点可区别全色数 |
Adjacent Vertex-Distinguishing E-Total Coloring on Mycielski's Graph of Some Graphs |
| |
Abstract: | This paper focuses on the relation between the basic graph G and it's Mycielski graph,the adjacent vertex-distinguishing E-total coloring of the Mycielski's graph of path,circle,star,fan,wheel and complete graph are discussed,and the adjacent vertex-distinguishing E-total chromatic numbers on Mycielski's graph of path,circle,star,fan,wheel and complete graph are obtained. |
| |
Keywords: | Mycielski's graph adjacent vertex-distinguishing E-total coloring adjacent vertexdistinguishing E-total chromatic number |
本文献已被 CNKI 等数据库收录! |
|