若干并图的优美标号  

Graceful Labeling of the Union of Some Graphs

作　　者：王涛[1] 闫守峰[1] 李德明[2] 

机构地区：[1]华北科技学院基础部,河北三河065201 [2]首都师范大学数学系,北京100048

出　　处：《数学的实践与认识》2012年第16期207-212,共6页Mathematics in Practice and Theory

基　　金：国家自然科学基金(10201022;10971144);北京市自然科学基金(1102015);中央高校基本科研业务费资助(2011B019)

摘　　要：证明了,对任意大于1的自然数m,n,p,非连通图(■ V ■)∪K_(n,p)是优美图;当k≤p,m=kn+3或m=kn+1时,非连通图(P_2 V ■)∪K_(n,p)是优美图;当p≥2,m=3k+1时,非连通图(P_2 V ■)∪K_(3,p)是优美图;对任意正整数n,p,非连通图(P_1 V P_(2n+2))∪_(n,p)是优美图.In this paper, we showed that for natural numbers m, n, p, which are greater than one, the graph（^—K2 V —Km） ∪Kn,p is graceful; when k is equal to or less thanp, and m = kn ＋ 3 or m = kn ＋ 1, the graph （P2 V ^—Km） ∪ Kn,p is graceful; when p is not less than two, and m = 3k ＋ l, （P2 V ^—Km） ∪ Ka,piS graceful; when,n,pare positive integer, （P1 V P2n＋2） ∪ Kn,p is graceful.

关 键 词：图 优美图 优美标号 非连通图 

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