On the Gracefulness of Product Graph C4n＋2×P4k＋3
Received:April 09, 1992  Revised:April 15, 1994
Key Words: product graph   graph indexing   graceful graph.  
Fund Project:
Author NameAffiliation
Yang Yanchang Dep.of Appl.Math.
Beijing Polytechnic University
100022 
Wang Guangxuan Computer-Roo
Miyun County Hospital
Beijing
101500 
Hits: 1953
Download times: 755
Abstract:
      It is shown that the product graph C4n＋2×P4k＋3 is graceful.
Citation:
DOI:10.3770/j.issn:1000-341X.1995.02.028
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.