摘要
将文献[5](Shee S C,Ho YS.The Cordiality of the Path-union ofnCopies of a Graph.Discrete Math,1996,151:221-229.)的结果推广到Tn-union的情形,且不要求每个节点的图形必须相同.并给出了任意圈和扇Tn-union的Cordial性的分析和证明.
The result of [5] is promoted to the situation of T,,-union without requiring all the graphs on the node be the same. A analytical proof is proposed on the cordiality of Tn-union of some graphs.
出处
《延边大学学报(自然科学版)》
CAS
2009年第4期312-314,共3页
Journal of Yanbian University(Natural Science Edition)