摘要
讨论路的笛卡尔积的邻点可区别的全染色问题,给出路的笛卡尔积Pn×Pm的邻点强可区别的全色数为χast(Pn×Pm)=5 n=2,m≥2或m=n=36 min{n。
The problem of strong-distinguishable full-coloring at the adjacent vertex of Cartesian product Pn×Pm of the path was discussed. The strong-distinguishable full-chromaticity number of Cartesian Pn×Pm was given as χast（Pn×Pm）=5 n=2,m≥2 or m=n=3 6 min{n,m}≥3 and m＋n≠6
出处
《兰州理工大学学报》
CAS
北大核心
2007年第2期164-167,共4页
Journal of Lanzhou University of Technology
基金
甘肃省教育厅科研基金资助项目(0511-05)
关键词
路
笛卡尔积图
邻点强可区别
全染色
path
Cartesian product
strong distinguishability at adjacent vertex
full-coloring
