|
|||||
|
|
| 关于路的k-方图的邻点可区别-边全染色和第一类弱全染色 | |
| 引用本文： | 严谦泰.关于路的k-方图的邻点可区别-边全染色和第一类弱全染色[J].安阳师范学院学报,2021(2):1-3. |
| 作者姓名： | 严谦泰 |
| 作者单位： | 安阳师范学院数学与统计学院 |
| 基金项目： | 河南省自然科学基金(项目编号0511013800);河南省高校重点科研项目(项目编号19B110004)。 |
| 摘 要： | 给出了路的k-方图的邻点可区别-边全染色数和第一类弱全染色数。 |
| 关 键 词： | 邻点可区别-边全染色 第一类弱全染色 邻点可区别-边全染色数 第一类弱全染色数 k-方图 |
Adjacent-vertex-distinguishing-edge Total Coloring and the First Weak Total Coloring of k-cube Graph of Path |
|
| YAN Qiantai.Adjacent-vertex-distinguishing-edge Total Coloring and the First Weak Total Coloring of k-cube Graph of Path[J].Journal of Aayang Teachers College,2021(2):1-3. | |
| Authors: | YAN Qiantai |
| Institution: | (School of Mathematics and Statistics,Anyang Normal University,Anyang 455000,China) |
| Abstract: | The adjacent-vertex-distinguishing-edge total chromatic number and the first weak total chromatic number of k-cube graph of path Pn are given. |
| Keywords: | 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 |
| 本文献已被 维普 等数据库收录！ | |