期刊文献+

P_m×F_n及C_m×F_n的邻点可区别全色数 被引量:1

On adjacent-vertex-distinguishing total chromatic number of P_m×F_n and C_m×F_n
原文传递
导出
摘要 研究了笛卡儿积图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
  • 相关文献

参考文献10

二级参考文献28

  • 1ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:175
  • 2田双亮,李敬文,马少仙,张忠辅,姚明.一类完全r-部图的邻点可区别全染色[J].兰州交通大学学报,2004,23(4):131-132. 被引量:3
  • 3张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学(A辑),2004,34(5):574-583. 被引量:192
  • 4韩金仓,张忠辅.关于θ图的若干参数[J].太原机械学院学报,1993,14(4):288-291. 被引量:3
  • 5Burris A C, Schelp R H. Vertex-distinguishing proper edge-colorings [J]. J of Graph Theory, 1997, 26:73-82.
  • 6Balister P N, Riordan O M, Schelp R H. Vertex distinguishing colorings of graphs[J]. J of Graph Theory, 2003, 42: 95-109.
  • 7ZHANG Zhong-fu, LIU Lin-zhong, WANG Jianfang. Adjacent strong edge coloring of graphs[J].Apptied Mathematics Letters, 2002, 15: 623-626.
  • 8Bondy J A, Murty U S R. Graph Theory with Applications [ M ]. New York: Macmillan and Elsevier, 1976.
  • 9Burris A C, Schelp R H. Vertex-distinguishing proper edge- colorings [J].J of Graph Theory, 1997, 26:73-82.
  • 10ZHANG Zhong-fu, LIU Lin-zhong, WANG Jian-fang. Adjacent strong edge coloring of graphs[J].Apptied Mathematics Letters, 2002, 15: 623-626.

共引文献216

同被引文献9

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部