期刊文献+

冠图S_n○P_m和S_n○C_m的邻点强可区别的Ⅵ-全染色 被引量:2

the Adjacent Vertex Strongly Distinguishing Ⅵ-Total Colorings of Crown Graphs of S_n○P_m and S_n○C_m
原文传递
导出
摘要 研究了两类冠图SnoPm和SnoCm的邻点强可区别的Ⅵ-全染色.根据冠图的结构特征,构造了一个从集合V(G)∪E(G)到色集合{1,2,…,k}的函数,给出了一种染色方案,得到了它们的邻点强可区别的Ⅵ-全色数. The adjacent vertex strongly distinguishing VI-total colorings of two crown graphs of SnoPm and SnoCm are studied. By constructing the function from V(G)∪E(G)to {1,2,…,k}, we gave a new coloring method according to the feature of these graphs, and obtained the adjacent vertex strongly distinguishing VI-total chromatic number of them.
作者 刘秀丽 LIU Xiu-li(School of Mathematics and Statistics, Heze University, Heze 274015, China)
出处 《数学的实践与认识》 北大核心 2019年第11期129-133,共5页 Mathematics in Practice and Theory
基金 山东省自然科学基金资(ZR2014AM032) 山东省高校科技计划资助项目(J13LI02)
关键词 邻点可区别的全染色 邻点强可区别的Ⅵ-全染色 邻点强可区别的Ⅵ-全色数 冠图 adjacent vertex-distinguishing total coloring adjacent vertex strongly distinguishing Ⅵ-total coloring adjacent vertex strongly distinguishing Ⅵ-total chromatic number crown graph
  • 相关文献

参考文献5

二级参考文献36

  • 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
  • 2ZHANG 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
  • 3张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学(A辑),2004,34(5):574-583. 被引量:192
  • 4Chen X E. On the adjacent vertex distinguishing total coloring numbers of graphs with △= 3. Discrete Math, 2008, 308:4003-4007. 被引量:1
  • 5Wang H. On the adjacent vertex distinguishing total chromatic number of the graphs with △(G) = 3. J Combin Optim, 2007, 14:87-109. 被引量:1
  • 6Hulgan J. Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math, 2009, 309:2548-2550. 被引量:1
  • 7Wang Y Q, Wang W F. Adjacent vertex distinguishing total colorings of outerplanar graphs. J Combin Optim, 2010, 19:123-133. 被引量:1
  • 8Wang W F, Wang Y Q. Adjacent vertex distinguishing total coloring of graphs with lower average degree. Taiwan Residents J Math, 2008, 12:979-990. 被引量:1
  • 9Appel K, Haken W. Every planar map is four colorable. Bull Amer Math Soc, 1976, 82:711-712. 被引量:1
  • 10Vizing V. On an estimate of the chromatic index of a p-graph. Diskret Anal, 1964, 3:25-30. 被引量:1

共引文献198

同被引文献4

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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