关于Pn3的优美性(英文)

Pn3 is a Graceful Graph

中文关键词:  P_n³图  优美标号  优美图

英文关键词:graph P_n³  graceful labelling  graceful graph

中文摘要:

      设G(V,E)是一个简单图,对自然数k,当V(G^k)=V(G,E(G^k)=E(G)∪{uv|d(u,v)=k},则称图G^k为k-次方图,本文证明了图P_n³的优美性。

英文摘要:

      Let G(V,E) be a simple graph and G^k be a k-power graph defined by V(G^k) = V(G), E(G^k) = E(G) ∪{uv|d(u,v) =k} for natural number k. In this paper, it is proved that P_n³ is a graceful graph.