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

若干倍图的Smarandachely邻点边染色 被引量：9

On the Smarandachely-adjacent-vertex edge coloring of some double graphs
原文传递
导出
摘要 图G(V,E)的Smarandachely邻点边色数是满足条件uv∈E(G),|C(u)\C(v)|≥1并且|C(v)\C(u)|≥1的一个正常边染色的最小边色数,其中C(u)={f(uv)|uv∈E(G)}。给出了路、圈、星、扇图的倍图的Smaran-dachely邻点边色数。 The Smarandachely-adjacent-vertex edge chromatic number of graph G is the smallest k for which G has a proper edge k-coloring.For any pair of adjacent vertices,the set of colors appearing at either vertex s incident edges is not a subset of the set of colors appearing at the other vertex s incident edges.The smarandachely adjacent vertex edge chromatic number of some double graphs are obtained.
作者 朱恩强 王治文 张忠辅
机构地区 兰州交通大学应用数学研究所 宁夏大学数学与计算机学院
出处 《山东大学学报（理学版）》 CAS CSCD 北大核心 2009年第12期25-29,共5页 Journal of Shandong University(Natural Science)
基金 国家自然科学基金资助项目(10771091) 兰州交通大学学生科研创新立项(DXS2008-0281114) 陕西省自然科学基础研究计划资助项目(SJ08A20)
关键词 倍图 Smarandachely邻点边染色 k-正常边染色 double graph the Smarandachely-adjacent-vertex edge coloring of a graph proper edge k-coloring
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献2

  • 1张忠辅,仇鹏翔,张东翰,卞量,李敬文,张婷.图的倍图与补倍图(英文)[J].数学进展,2008,37(3):303-310. 被引量：21
  • 2ZHANG 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. 被引量：174

二级参考文献15

  • 1[1]Bondy,J.A.,Murty,U.S.R.,Graph Theory With Application.New York:The Macmillan Press Ltd,1976.
  • 2[2]Tian Feng,Ma Zhongfan,The Theory of Graphs and Networks,The Press of Science,1987.
  • 3[3]Marek Kubale,Graph Coloring,American Mathematical Society Providence,Rhode Island,2004.
  • 4[4]Kostochka,A.V.,The total coloring of a multigraph with maximal degree 4,Discrete Mathematics,1977,17:161-163.
  • 5[5]Sanchez-Arroyo,A.,Determining the total colouring number is NP-haxd,Discrete Mathematics,1989,78:315-319.
  • 6[6]Yap,H.P.,Total colourings of graphs,Lecture Notes in Mathematics,vol.1623,Springer,Berlin,1996.
  • 7[7]Zhang Zhongfu,Zhang Jianxun,Wang Jianfang,The total chromatic number of some graph,Sci.Sinica Set.A,1988,31(12):1434-1441.
  • 8[8]Zhang Zhongfu,Wang Jianfang,A summary of the progress on total colorings of graphs,Adv.in math.(China),1992,21:390-397.
  • 9[9]Zhang Zhongfu,Liu Linzhong,Wang Jianfang,Adjacent strong edge coloring of graphs,Applied Mathematics Letters,2002,15:623-626.
  • 10[10]Hamed Hatami,A+300 is a bound on the adjacent vertex distinguishing edge chromatic number,Journal of Combinatorial Theory,Series B,2005,95:246-256.

共引文献191

同被引文献51

  • 1ZHANG 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. 被引量：55
  • 2ZHANG 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. 被引量：174
  • 3WOODALL Douglas R.Adjacent strong edge colorings and total colorings of regular graphs[J].Science China Mathematics,2009,52(5):973-980. 被引量：10
  • 4ZHANG ZhongFu,CHENG Hui,YAO Bing,LI JingWen,CHEN XiangEn,XU BaoGen.On the adjacent-vertex-strongly-distinguishing total coloring of graphs[J].Science China Mathematics,2008,51(3):427-436. 被引量：79
  • 5张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学（A辑）,2004,34(5):574-583. 被引量：192
  • 6张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报（中文版）,2006,49(3):703-708. 被引量：96
  • 7BONDY J A,MURTY U S R Graph theory[M].London:Springer,2008.
  • 8ZHANG Z F,LIU L Z,WANG J F.Adjacent strong edge coloring of graphs[J].Appl Math Lett,2002,15:623-626.
  • 9HATAMI H.△+300 is a bound on the adjacent vertex distinguishing edge chromatic number[J].journal of Combinatorial Theory;Series B,2005,95:246-256.
  • 10LI J W,ZHANG Z F,CHEN X E,et al.A note on adjacent strong edge coloring on K(n,m)[J].Acts Mathematicae Applicatae Sinaca,English Series,2006,22:273-276.

引证文献9

二级引证文献13

山东大学学报（理学版）
2009年 第12期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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