摘要
该文用一种新的标号法证明了l(l≥1的整数)个不同的网的不交并图Us=1lPns×Pms是k-优美的.
With a new method of labeling it is proved in this paper that the graph Us=1lPns×Pms -the result of l（l is and integer and l≥1） different net graphs of disjoint union is k-graceful.
出处
《集宁师范学院学报》
2012年第3期92-95,共4页
Journal of Jining Normal University
关键词
k—优美性
不交并
网格图
k-Graceful graph
the disjoint union
net graphs
