Gracefulness of Graph ∪i=1 to n( )F_(m_i,t_i) and ∪i=1 to n( )H_(m_i,t_i)
Di Yang · Science Technology and Engineering · 2008
Two kinds of unconnected graphs of ∪i=1 to n( )F_(m_i,t_i) and ∪i=1 to n( )H_(m_i,t_i),tiare defined furthermore the unconnected graphs of ∪ni=1Hmi,tiand ∪ni=1Hmi,t are graceful ones and they are alternating ones are proved.