| 关于2G与路的并的优美标号 |
| |
| 引用本文： | 张志尚. 关于2G与路的并的优美标号[J]. 辽宁师范大学学报(自然科学版), 2012, 35(2): 159-163 |
| |
| 作者姓名： | 张志尚 |
| |
| 作者单位： | 吉林工程技术师范应用理学院,吉林长春,130052 |
| |
| 基金项目： | 吉林省教育厅十一五科研课题 |
| |
| 摘 要： | 设G是有q条边的优美二部图,优美标号为θ,pm是有m条边的简单路,C=k 0〈k〈q,k≠θ（v）,v∈V（G{）},a=maxC,b=minC,h=min q-a＋2,b{}＋2.图G∪G∪Pm是两个图G与一条简单通路的不交并.证明了：当m=1或m≥h时,图G∪G∪Pm是优美的.应用此结论,得到：对所有的s≥2,t≥2,当m=1或m≥3时,图Ks,t∪Ks,t∪Pm是优美的.
|
| 关 键 词： | 优美标号 优美图 不交并 路 |
On the gracefulness of disjiont union graph 2G and a path |
| |
| ZHANG Zhi-shang. On the gracefulness of disjiont union graph 2G and a path[J]. Journal of Liaoning Normal University(Natural Science Edition), 2012, 35(2): 159-163 |
| |
| Authors: | ZHANG Zhi-shang |
| |
| Affiliation: | ZHANG Zhi-shang(School of Applied Sciense,Jilin Teacher’s Institute of Engineering and Technology,Changchun 130052,China) |
| |
| Abstract: | The present paper deals with the gracefulness of unconnected graph G∪G∪Pm,and proves the following results：let G is a graceful bipartite graph with qedges,gracefulabeling of G is θ,C=k0〈k〈q,k≠θ（v）,v∈V（G）,a=maxC,b=minC,h=minq-a＋2,b＋2,pm is a path with m edges.if m=1 or m≥h,then G∪G∪Pm be a graceful graph.Based on this,the graph Ks,t∪Ks,t∪Pm is proved to be graceful for s≥2,t≥2,and m≠2. |
| |
| Keywords: | graceful labeling graceful graph disjoint union path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
