J4

Previous Articles     Next Articles

The Gracefulness of Graph ∪ni=1Fmi,4

YANG Xian-wen1, PAN Wei2   

  1. 1. Jilin Teacher’s Institute of Engineering and Technology, Changchun 130052, China;2. College of Mathematics, Jilin University, Changchun 130012, China
  • Received:2003-04-09 Revised:1900-01-01 Online:2003-10-26 Published:2003-10-26
  • Contact: PAN Wei

Abstract: The present paper defines a kind of unconnected graphs of ni=1Fmi,4. Furthermore we have proved that the unconnected graphs of ∪ni=1Fmi ,4 are graceful ones and it is alternating ones.

Key words: graph, unconnected graph, graceful graph, alternating graph

CLC Number: 

  • O157.9