Pn3 is a Graceful Graph
Received:November 18, 2002  
Key Words: graph Pn3   graceful labelling   graceful graph  
Fund Project:
Author NameAffiliation
YAN Qian-tai Dept. of Math.
Anyang Teachers College
Henan
China 
ZHANG Zhong-fu Dept. of Computer
Lanzhou Teacher College
Gansu
China
Dept. of Math.
Northwest Normal University
Lanzhou
China 
Hits: 2331
Download times: 1813
Abstract:
      Let G(V,E) be a simple graph and Gk be a k-power graph defined by V(Gk) = V(G), E(Gk) = E(G) ∪{uv|d(u,v) =k} for natural number k. In this paper, it is proved that Pn3 is a graceful graph.
Citation:
DOI:10.3770/j.issn:1000-341X.2004.02.011
View Full Text  View/Add Comment