2类包含K_4的优美图及其注记  

Two Kinds of Graceful Graphs Including K_4 and Their Labeling

作　　者：唐保祥[1] 

机构地区：[1]天水师范学院 数学系,甘肃天水741001

出　　处：《河北师范大学学报（自然科学版）》2001年第3期304-305,314,共3页Journal of Hebei Normal University：Natural Science

摘　　要：利用计算机为辅助工具，分别给出了２类包含图Ｋ４的图Ｋ４＋Ｇｎ＋１和Ｋ４＋Ｋｎ，ｎ的优美标号，从而证明了图Ｋ４＋Ｇｎ＋１和Ｋ４＋Ｋｎ，ｎ是优美图，并由Ｋ４＋Ｋｎ，ｎ的优美性给出了边数为ｍ的极小优美图的顶点数ｆ（ｍ）的范图是｛（１＋８ｍ＋１）／２｝≤ｆ（ｍ）≤｛２（ｍ＋３－１）｝．The graceful labelings of two kinds of graphs including K-4 was gaven.One is K4+Gn+1 graphs,the other is K4+Kn,n graph＇s.So,it＇s proved that K4+Gn+1 graph and K4+Kn,n graph are graceful graphs,and according to K4+Kn,n graph＇s graceful given to the range of the vertes f(m) of the lest graceful graph of edge m is {(1+8m+1)/2}≤f(m)≤{2(m+3-1)}.

关 键 词：完全图 完全偶图 优美图 极小优美图 优美称号 顶点数 

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