关于G∪K_(m_in_i)from i=1 to k的优美性  

On gracefulness ofG∪K_(m_in_i)from i=1 to k

作　　者：潘伟[1] 杨显文[2] 

机构地区：[1]吉林大学数学学院,吉林长春130012 [2]吉林工程技术师范学院基础部,吉林长春130052

出　　处：《吉林大学学报（信息科学版）》2004年第5期513-516,共4页Journal of Jilin University（Information Science Edition）

摘　　要：为加强对非连通图的优美性的研究 ,对于自然数 k,mi,ni,给出一类非连通图∪ki=1 Kmi,ni,通过构造标号函数的方法 ,证明了当 max{mi,ni}≥ 3 ,min{mi,ni}≥ 2 ( i =1 ,2 ,… ,k)时 ,这类图既是优美图 ,也是交错图 ;并进行了推广 ,得出由满足一定条件的交错图 G和 Gi( i=1 ,2 ,… ,k)并起来的非连通图 G∪ni=1 Gi 是优美图 。In order to improve the study of the gracefulness of the disconnected graph,for natural numbers k ,m_i ,n_i,a kind of unconnected graph∪ki=1K_(m_i,n_i) was given.Furthermore it was proved that when max{m_i ,n_i}≥3, min{m_i,n_i}≥2 (i =1,2,…,k),the graph ∪ki=1K_(m_i,n_i) is graceful and alternating graph. And it is spreading widely.Let G and G_i (i=1,2,…,k) be the graceful graphs, the graph G∪ni=1G_i(joined by disconnected graphs ) is a graceful graph for given conditions.And a way to make a union of many graceful graphs union for the graceful graph was given.

关 键 词：简单图 非连通图 优美图 交错图 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术] O157.9[自动化与计算机技术—计算机科学与技术]