期刊文献+

图C_m^2×S_n与C_m^2×F_n与的gndt-染色

On the General Neighbour-distinguishing Total Coloring of C_m^2×S_n and C_m^2×F_n
下载PDF
导出
摘要 单图G的邻点可区别的非正常全染色是指图的任意相邻两顶点的色集合都不同的全染色.所谓顶点的色集合是指顶点自身的颜色及与其关联的所有边的颜色的集合.文中讨论了笛卡儿积图C_m^2×S_n和C_m^2×F_n的邻点可区别非正常全染色,并给出了相应色数. The general neighbour-distinguishing total coloring of graph G is the total coloring that the color set of adjacent vertices are different.The color set of a vertex is the color of all edges incident to the vertex and the color of vertex.In this paper,we obtain the general neighbour-distinguishing total chromatic number of C_m2×S_n and C_m2×F_n.
出处 《河西学院学报》 2011年第2期50-53,共4页 Journal of Hexi University
基金 国家自然科学基金资助项目(10771091) 甘肃省教育厅科研资助项目(0501-02)
关键词 邻点可区别的非正常全染色 邻点可区别的非正常全色数 General neighbour-distinguishing total coloring General neighbour-distinguishing total chromatic number
  • 相关文献

参考文献2

二级参考文献15

  • 1张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报(中文版),2006,49(3):703-708. 被引量:96
  • 2Burris A C,Schelp R H.Vertex-distinguishing proper edge-colorings.J of Graph Theory,1997,26(2): 73-82
  • 3Bazgan C,Harkat-Benhamdine A,Li H,et al.On the vertex-distinguishing proper edge-coloring of graphs.J Combin Theory,Ser B,1999,75: 288-301
  • 4Balister P N,Bollobas B,Schelp R H.Vertex distinguishing colorings of graphs with △(G)=2.Discrete Mathematics,2002,252(2): 17-29
  • 5Zhang Zhongfu,Liu Linzhong,Wang Jianfang.Adjacent strong edge coloring of graphs.Applied Mathematics Letters,2002,15:623-626
  • 6Dietel Reinhard.Graph Theory.New York:Springer-Verlag,1997
  • 7Chartrand G,Lesniak-Foster L.Graph and Digraphs.2nd Edition.Monterey,CA: WadsworthBrooks/Cole,1986
  • 8Hansen P,Marcotte O.GraphColoring and Application.Providence: AMS,1999
  • 9Bondy J A,Murty U S R.Graph Theory with Applications.New York: American Elsevier,1976
  • 10BURRIS A C, SCHELP R H. Vertex-distinguishing proper edge-colorings[J]. J Graph Theory, 1997, 26(2):73-83.

共引文献203

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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