摘要
研究了笛卡儿积图Pm×Fn的邻点可区别全染色问题.运用构造法得到了其邻点可区别全色数,然后从图的结构关系上进一步获得了Cm×Fn的邻点可区别全色数.
In this paper, the adjacent- vertex -distinguishing total coloring on the Cartesion product graph Pm×Fn is studied, and the corresponding chromatic number is obtained by the method of construction. And at the same time, the total chromatic number of the Cartesion product graph Cm× Fn is given by analyzing the structural relationship between them.
出处
《福州大学学报(自然科学版)》
CAS
CSCD
北大核心
2010年第5期644-648,共5页
Journal of Fuzhou University(Natural Science Edition)
基金
国家自然科学基金资助项目(40301037)
连云港师范高等专科学校首批"青蓝工程"人才资助项目
关键词
图
笛卡尔积图
邻点可区别全染色
graph
cartesion product graph
adjacent -vertex -distinguishing total coloring