期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

关于P_m∨S_n的点可区别全染色 被引量：3

On Vertex-distinguishing Total Coloring of P_m∨S_n
在线阅读 下载PDF
导出
摘要 对一个正常的全染色满足不同点的点及其关联边染色的色集不同时,称为点可区别全染色,其所用最少染色数称为点可区别全色数.本文得到了路Pm与星Sn的联图Pm∨Sn的点可区别全色数. A total coloring is called vertex distinguishing if every two vertices are incident to different sets of colored vertex and incident edge with vertex. The minimum number of colors required for a vertex-distin-guishing total coloring,a simple graph G is denoted by Xvt, （G）. In this paper, we obtain the vertex-distin- guishing total chromatic number of Pm∨ Sn.
作者 马刚 马少仙 张忠辅
机构地区 西北民族大学计算机科学与信息工程学院 兰州交通大学应用数学研究所
出处 《兰州交通大学学报》 CAS 2007年第4期136-138,共3页 Journal of Lanzhou Jiaotong University
基金 国家自然科学基金资助项目(40301037) 国家民委科研项目(05XB07)
关键词 路 星 联图 点可区别全色数 path star joingraph vertex-distinguishing total chromatic number
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献7

  • 1Zhang Zhongfu, Liu Linzhong, Wang Jianfang. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters,2002,15(5): 623-626.
  • 2张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学（A辑）,2004,34(5):574-583. 被引量：193
  • 3Bazgan C, Harkat-Benhamdine A, Li H, et al. On the vertex-distinguishing edge-colorings of graphs[J]. J of Combin Theory, 1999,75:288-301.
  • 4马刚,马少仙,张忠辅.图P_m V W_n的点可区别边色数[J].兰州大学学报（自然科学版）,2007,43(2):103-106. 被引量：8
  • 5ZHANG Zhongfu,LI Jingwen,CHEN Xiang’en,YAO Bing, WANG Wenjie & QIU Pengxiang Institute of Applied Mathematic, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China.D(β)-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2006,49(10):1430-1440. 被引量：57
  • 6Bondy J A,Murty U S R. Graph theory with application[M]. Macmillan Press LTD, 1976.
  • 7Yap H P. Total colorings of graphs[M]. Berlin: Lecture Notes in Mathematics, 1623, Springer, 1996.

二级参考文献15

  • 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. 被引量：179
  • 2王治文,张忠辅,闫丽宏.P_m∨P_n的点可区别边色数[J].兰州大学学报（自然科学版）,2005,41(6):100-101. 被引量：7
  • 3张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报（中文版）,2006,49(3):703-708. 被引量：97
  • 4Burris A C,Schelp R H.Vertex-distinguishing proper edge-colorings.J of Graph Theory,1997,26(2): 73-82
  • 5Bazgan 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
  • 6Balister P N,Bollobas B,Schelp R H.Vertex distinguishing colorings of graphs with △(G)=2.Discrete Mathematics,2002,252(2): 17-29
  • 7Zhang Zhongfu,Liu Linzhong,Wang Jianfang.Adjacent strong edge coloring of graphs.Applied Mathematics Letters,2002,15:623-626
  • 8Dietel Reinhard.Graph Theory.New York:Springer-Verlag,1997
  • 9Chartrand G,Lesniak-Foster L.Graph and Digraphs.2nd Edition.Monterey,CA: WadsworthBrooks/Cole,1986
  • 10Hansen P,Marcotte O.GraphColoring and Application.Providence: AMS,1999

共引文献247

同被引文献11

引证文献3

二级引证文献3

兰州交通大学学报
2007年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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