图PnΥSm的优美标号
Graceful Labeling of Graphs PnΥSm
摘要:
图G的标号是指G的顶点集到一个整数集的映射g，且对e=uv∈E(G)由g(u)和g(v)诱导出边e的标号。本文给出了图P
nE
¨S
m的优美性。即证明了图P
nE
¨S
m是优美图。进而推广了原有的一些结果。
Abstract:
The labeling of a graph G is injection g of the labels of vertices to a set of integers, and the labels of each edge e = uv are induced by the g(u) and g(v). In the paper, we obtain the graceful labeling for graphs PnE¨Sm , which proves its gracefulness, and then extend the original results.
参考文献
|
[1]
|
Ringel, G. (1963) Problem 25 in Theory and Its Application. Proceedings of the Symposium, Smolenice, 57-162.
|
|
[2]
|
Rosa, A. (1966) On Certain Valuations of the Vertices of a Graph. Theory of Graphs, Proceedings of International Symposium, Rome, 349-355.
|
|
[3]
|
Golomb, S.W. (1972) How to Number a Graph. In: Read, R.C., Ed., Graph Theory and Computing, Academic Press, New York, 23-37.
|
|
[4]
|
Gallian, J.A. (2013) A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 16, 33-69.
|
|
[5]
|
梁怀学, 刘春峰. 关于图的K——优美性[J]. 东北师大学报, 1991(1): 41-44.
|
|
[6]
|
刘春峰, 赵连昌. m重-四角鲜人掌图的优美性和序列性[J]. 吉林师范大学学报, 2006, 27(2): 4-6.
|
|
[7]
|
刘春峰. 关于联图优美性的一点注记[J]. 辽宁工学院学报, 2005, 5(25): 347-348.
|
|
[8]
|
刘春峰, 林跃进, 赵连昌. 路及其相关图的序列性[J]. 数学理论与应用, 2006, 4(26): 17-20.
|
|
[9]
|
刘春峰. 关于图的标号的一点注记[J]. 湖北民族学院学报, 1996(2): 82-83.
|
|
[10]
|
刘春峰. 链路Pn(m)的优美性和序列性[J]. 理论数学, 2018, 8(2): 723-729.
|
|
[11]
|
马克杰. 优美图[M]. 北京: 北京大学出版社, 1991.
|
|
[12]
|
索南仁欠. 一类图φ*(n, k+1)的优美性[J]. 辽宁师范大学学报(自然科学版), 2008, 31(1): 15-16.
|