| 优美图的嵌入 |
| |
| 引用本文： | 唐保祥,.优美图的嵌入[J].上海师范大学学报(自然科学版),2007,36(2):24-27. |
| |
| 作者姓名： | 唐保祥 |
| |
| 作者单位： | 天水师范学院数理与信息科学学院,甘肃天水,741001 |
| |
| 摘 要： | 研究了优美与优美图之间的一种关系，每个优美图都可嵌入到另一个优美图中．通过构造证明了：设G1是任一个优美图，则必存一个优美图G2，使得G1是G2的真子图．这一结论给出了由一个优美图构造一类优美图的一种方法，并用此方法给出了几类优美图．
|
| 关 键 词： | 优美图 极大优美图 极小优美图 联图 |
| 文章编号： | 24366153 |
| 修稿时间： | 10 21 2006 12:00AM |
Any graceful graph is the subgraph of another graceful graph |
| |
| TANG Bao-xiang.Any graceful graph is the subgraph of another graceful graph[J].Journal of Shanghai Normal University(Natural Sciences),2007,36(2):24-27. |
| |
| Authors: | TANG Bao-xiang |
| |
| Institution: | School of Maths, Physics and Information Science, Tianshui Normal Institute, Tianshui 741001, Gansu, China |
| |
| Abstract: | A kind of relationship between the grace and the graceful graph is studied which shows that any graceful graph can be embedded into another one. It is proved that if graph G1 is any graceful graph, there must be a graceful graph G2 such that G is a real subgraph of graph G2. Thus, a series of graceful graphs can be constructed from one graceful graph. And several kinds of graceful graphs are produced using this method. |
| |
| Keywords: | graceful graph maximal graceful graph minimal graceful graph join of two graphs |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《上海师范大学学报(自然科学版)》下载免费的PDF全文 |
