Journal of Jilin University Science Edition

Previous Articles     Next Articles

Gracefulness of Three Types Special Graphs

TANG Baoxiang1, REN Han2   

  1. 1. School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741001, Gansu Province, China;2. Department of Mathematics, East China Normal University, Shanghai 200062, China
  • Received:2016-04-11 Online:2016-11-26 Published:2016-11-29
  • Contact: TANG Baoxiang E-mail:tbx0618@sina.com

Abstract: We prove that  K4-P(n,2),K3-P(n,2) and I(K1,1,n) are graceful graphs by using the constructive method, which
gives the  graceful labeling of graphs K4-P(n,2),K3-P(n,2) and I(K1,1,n).

Key words: graceful labeling, corona, graceful graph, complete tripartite graph

CLC Number: 

  • O157.5