文章摘要
王蓓蓓,祁丽娟,刘信生,陈祥恩.完全二部图 K 5,7 点强可区别全染色方案探讨[J].,2016,56(3):309-312
完全二部图 K 5,7 点强可区别全染色方案探讨
Probe of schemes for vertex strongly distinguishing total coloring of complete bipartite graph K 5,7
  
DOI:10.7511/dllgxb201603014
中文关键词: 正常全染色  完全二部图  点强可区别全染色  点强可区别全色数
英文关键词: proper total coloring  complete bipartite graph  vertex strongly distinguishing total coloring  vertex strongly distinguishing total chromatic number
基金项目:国家自然科学基金资助项目(611630376116305461363060).
作者单位
王蓓蓓,祁丽娟,刘信生,陈祥恩  
摘要点击次数: 801
全文下载次数: 738
中文摘要:
      利用组合分析的方法先讨论了完全二部图K 5,7 的点强可区别全染色,在此基础之上给出了两种具体的关于完全二部图K 5,7 的点强可区别全染色方案.此结果的给出不仅确定了完全二部图K 5,7 的点强可区别全色数为9,而且对于胡志涛所提出的关于完全二部图的点强可区别全染色的猜想 “如果m≥4且n<2m-2时,那么χ vst (K m,n )=n+3”中当m=5时作出了否定,从而进一步确定了此猜想成立的范围.
英文摘要:
      Firstly, the vertex strongly distinguishing total coloring of complete bipartite graph K 5,7 is discussed using the method of combinatorial analysis. Then, based on the discussion, two schemes about the vertex strongly distinguishing total coloring of complete bipartite graph K 5,7 are put forward. The results not only help to determine the vertex strongly distinguishing total chromatic number of complete bipartite graph K 5,7 which is equal to nine, but also negate the conjecture proposed by Hu Zhi-tao: ″If m ≥4 and n<2m-2 , then χ vst ( K m,n )=n+3 ″ when m =5. Furthermore, the scope which makes this conjecture established is determined.
查看全文   查看/发表评论  下载PDF阅读器
关闭