期刊文献+

关于几类图的邻点可区别关联色数 被引量:3

The adjacent vertex-distinguishing incidence coloring number of classes graphs
下载PDF
导出
摘要 邻点可区别关联着色的定义是在关联着色的基础上提出的,是使得相邻顶点的颜色集不同的关联着色.主要研究了几类特殊图的邻点可区别关联色数,包括风车图、齿轮图及在此基础上扩充的图Dm,n,拓展了图着色的领域,便于更好地研究图的结构. The adjacent vertex-distinguishing incidence coloring is raised based on the definition of incidence oloring,and incidence coloring satisfiying the sets of the colors of two adjacent vertices are diffrent. We mostly study the adjacent vertex-distingushing incidence coloring number of some special graphs,including the windmill graph,gear graph and Dm、n. It exploits the area of the graph coloring and makes for studying the structure of graphs.
出处 《山东理工大学学报(自然科学版)》 CAS 2008年第5期105-107,共3页 Journal of Shandong University of Technology:Natural Science Edition
关键词 邻点可区别关联着色 风车图 齿轮图 adjacent vertex-distinguishing incidence coloring windmill graph gear graph
  • 相关文献

参考文献6

二级参考文献11

  • 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
  • 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-coloring[J]. J of Graph theory, 1977,21,73-82.

共引文献220

同被引文献21

  • 1陈东灵,刘西奎,王淑栋.图的关联色数和关联着色猜想[J].经济数学,1998,15(3):47-51. 被引量:29
  • 2马刚,马明,张忠辅.皇冠图G_(n,m)的邻点可区别边色数[J].华东交通大学学报,2005,22(2):141-143. 被引量:6
  • 3李光海,李武装.关于几类图的邻点可区别全染色[J].河南师范大学学报(自然科学版),2006,34(1):139-140. 被引量:5
  • 4Brualdi R A,Quinn Massey J J.Incidence and strong edge colorings of graphs[J].Discrete Math,1993,122:51-58.
  • 5Guiduli B.On incidence coloring and star arboricity of graphs[J].Discrete Mathematics,1997,163:275-278.
  • 6Algor I,Alon N.The star arboricity of graphs[J].Discrete Mathematics,1989,75:11-22.
  • 7Wang Shu-dong,Chen Dong-ling,Pang Shan-chen.The incidence coloring number of Halin graphs and outerplanar graphs[J].Discrete Mathematics,2002,256:397-405.
  • 8Mohammad H D,Sopena E,Zhu Xu-ding.Incidence coloring of k-degenerated graphs[J].Discrete Mathematics,2004,283:121-128.
  • 9Huang Cheng-i,Wang Yue-li,Chung S S.The incidence coloring numbers of meshes[J].Computers and Mathematics with Applications,2004,48:1 643-1 649.
  • 10Maksim M.The incidence coloring conjecture for graphs of maximum degree 3[J].Discrete Mathematics,2005,292:131-141.

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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