期刊文献+

图K_(4,4)∨K_t的点可区别正常边染色 被引量:1

On the Vertex-Distinguishing Proper Edge-Coloring of K_(4,4)∨K_t
原文传递
导出
摘要 讨论了图K4,4∨Kt的点可区别正常边染色及其色数.利用正多边形的对称性构造染色以及组合分析的方法.确定了图K4,4∨Kt的点可区别正常边色数,得到了:当t是奇数且t≥3以及t是偶数且2≤t≤32时,χ′s(K4,4∨Kt)=t+8;当t是偶数且t≥34时,χ′s(K4,4∨Kt)=t+9. In this paper, the authors discuss the vertex-distinguishing proper edge colorings of K4,4∨Kt,and using the symmetry of regular polygons to construct coloring and the methods of combinatorial analysis, determine the vertex-distinguishing proper edge chromatic number of K4,4∨Kt. Finally, the authors show that χ:(K4,4∨Kt):t+8 when t is odd with t≥3 and when t is even with 2≤t≤32, and that xs(K4,4∨Kt) =t+9 when t is even with t≥34.
出处 《西南大学学报(自然科学版)》 CAS CSCD 北大核心 2012年第6期78-82,共5页 Journal of Southwest University(Natural Science Edition)
基金 国家自然科学基金资助项目(61163037 61163054) 宁夏大学科学研究基金资助项目((E)ndzr10-7) 宁夏自然基金资助项目(NZ1154)
关键词 正常边染色 点可区别正常边染色 点可区别正常边色数 proper edge coloring vertex-distinguishing proper edge coloring vertex-distinguishing proper edge chromatic number
  • 相关文献

参考文献11

  • 1BURRIS A C. Vertex-Distinguishing Edge-Colorings[D]. Memphis: Memphis State University, 1993.
  • 2CERN J, HORI-;IA.K M, SOT/kK R. Observability of a Graph [J]. Math Slovaca, 1996, 46: 21-31.
  • 3HORHL.K M, SOTAK R. Observability of Complete Multipartite Graphs with Equipotent Parts [J]. Ars Combin, 1995, 41: 289-301.
  • 4HORI;IAK M, SOTAK R. Asymptotic Behavior of the Observability of Q, [J]. Discrete Mathematics, 1997, 176: 139-148.
  • 5BALISTER P N, BOLLOBJiS B, SCHELP R H. Vertex Distinguishing Colorings of Graphs with A(G)=2 [J].Dis- crete Mathematics, 2002, 252: 17-29.
  • 6BALISTER P N, RIORDAN O M, SCHELP R H. Vertex-Distinguishing Edge Colorings of Graphs [J].J Graph Theo ry, 2003, 42: 95-109.
  • 7BAZGAN C, HARKAT-BENHAMDINE A, LI Hao, et al. On the Vertex-Distinguishing Edge Colorings of Graphs [J]. J CombinTheory, 1999, 75(2): 288-301.
  • 8BURRIS A C, SCHELP R H. Vertex-Distinguishing Proper Edge-Colorings[J].Graph Theory, 1997, 26(2) : 73-82.
  • 9马彦荣,王治文,陈祥恩,姚兵.mK_(2,3)的点可区别全染色[J].西南大学学报(自然科学版),2011,33(6):115-120. 被引量:4
  • 10龚劬,孙婷婷.C_m·P_n的距离不大于β的任意两点可区别的边染色[J].西南师范大学学报(自然科学版),2008,33(1):5-8. 被引量:3

二级参考文献18

  • 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包世堂,刘君,任志国,赵传成.C_m·P_n图的邻强边色数[J].兰州交通大学学报,2004,23(6):146-147. 被引量:3
  • 3张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报(中文版),2006,49(3):703-708. 被引量:97
  • 4ZhangZhongfu.On the Adjacent Vertex—Distinguish Total Coloring of Graphs[J].中国科学:A辑,2004,10:574-583.
  • 5Bela Bollobas.Modern Graph Theory[M].New York:Springer-Verlag,1998.
  • 6Dietel Reinhard.Graph Theory[M].New York:Springer-Verlag,1997.
  • 7Chartrand G,Lesniak-Foster L.Graph and Digraphs[M].Monterey:Wadsworth Brooks/Cole,1986.
  • 8Hansen P,Marcotte O.Graph coloring and application[M].Rhode Island:AMS Providence,1999.
  • 9Burris A C,Schelp R H.Vertex-distinguishing proper edge-colorings[J].Graph Theory,1997,26:73-82.
  • 10Bazgan 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.

共引文献11

同被引文献5

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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