链路Pn(m)优美性和序列性

The Gracefulness and Sequences of Pn(m)

摘要: 图G的标号是指G的顶点集到一个整数集的映射g，且对e=uv∈E(G)由g(u)和g(v)诱导出边e的标号。本文给出了链路Pn(m)的k-优美性和序列性。即证明了图Pn(m)是k-优美图和序列图，从而也是调和图。进而推广了原有的一些结果。

Abstract: The labelling 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, the k-gracefulness and sequence of graphs are given, and we also prove Pn(m) graph is k-graceful, sequential, and harmonious.