优美图的嵌入  

Any graceful graph is the subgraph of another graceful graph

作　　者：唐保祥[1] 

机构地区：[1]天水师范学院数理与信息科学学院,甘肃天水741001

出　　处：《上海师范大学学报（自然科学版）》2007年第2期24-27,共4页Journal of Shanghai Normal University(Natural Sciences)

摘　　要：研究了优美与优美图之间的一种关系,每个优美图都可嵌入到另一个优美图中.通过构造证明了:设G1是任一个优美图,则必存一个优美图G2,使得G1是G2的真子图.这一结论给出了由一个优美图构造一类优美图的一种方法,并用此方法给出了几类优美图.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.

关 键 词：优美图 极大优美图 极小优美图 联图 

分 类 号：O157.5[理学—数学]