图∪i=1 to n( )F_(m_i,t_i)和∪i=1 to n( )H_(m_i,t_i)的优美性  

Gracefulness of Graph ∪i=1 to n( )F_(m_i,t_i) and ∪i=1 to n( )H_(m_i,t_i)

作　　者：杨迪[1] 刘春峰[1] 

机构地区：[1]辽宁工业大学数理系,锦州121001

出　　处：《科学技术与工程》2008年第9期2285-2287,2306,共4页Science Technology and Engineering

摘　　要：构造了两类非连通图∪i=1 to n( )F_(m_i,t_i)和∪i=1 to n( )H_(m_i,t_i),并证明了这两类图是优美的,且也是交错的。Two kinds of unconnected graphs of nUi=1Fmi,ti and nUi=1Fmi,tiare defined furthermore the unconnected graphs of nUi=1Fmi,ti and nUi=1Fmi,ti are graceful ones and they are alternating ones are proved.

关 键 词：图 非连通图 优美图 交错图 

分 类 号：O157.5[理学—数学]