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: 2444
Download times: 1895
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  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.