| 确定某些对虾树的优美性(英文) |
| |
| 引用本文： | 赵梅梅,谢继国,姚兵.确定某些对虾树的优美性(英文)[J].甘肃高师学报,2008,13(2):11-13. |
| |
| 作者姓名： | 赵梅梅 谢继国 姚兵 |
| |
| 作者单位： | 1. 西北师范大学,甘肃,兰州,730070
2. 兰州城市学院,甘肃,兰州,730070 |
| |
| 摘 要： | 众所周知,优美树猜想(GTC)自1966年Rosa提出到今天已经成为一个非常著名的未解决的问题,GTC问题最初来自于把完全图K2n+1分解成同构于任意一棵预先指定的n条边的树的2n+1个子图.尽管有大量的有关GTC的文章发表,但彻底解决这个猜想还很遥远.故而,人们把研究GTC的范围缩小到一些特定类型的树上来,如Bermond的猜想:每一棵对虾树都是优美的(1997).由此启发,我们确定了几类对虾树的优美性,并提出了几个问题以供进一步研究.
|
| 关 键 词： | 全染色 优美标号 对虾图 树 |
| 文章编号： | 1008-9020(2008)02-011-03 |
| 修稿时间： | 2007年8月28日 |
Toward to the gracefulness of some lobsters |
| |
| ZHAO mei mei,XIE Ji guo,YAO Bing.Toward to the gracefulness of some lobsters[J].Journal of Gansu Normal College,2008,13(2):11-13. |
| |
| Authors: | ZHAO mei mei XIE Ji guo YAO Bing |
| |
| Abstract: | As we have known,the Graceful Trees Conjecture(GTC)is a longstanding conjecture posed by Rosa in 1966 since it comes from attacking the famous conjecture:any complete graph K2n 1 can be decomposed into 2n 1 subgraphs which are isomorphic with a given tree with n edges.Despite the tremendous work,someone suggest to attack GTC in some small areas,such as Bermond conjecture that every lobster is graceful in 1979.Motivated,we discuss the gracefulness about some interesting classes of lobsters. |
| |
| Keywords: | proper total coloring graceful labeling lobsters trees |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
