摘要
探讨了完全二部图Km1,m2,完全图卡氏积图Km×Kn和完全图并图Km+Kn的表示数。找出了Km1,m2表示数的上限,并进一步缩小上限;获得了Km×Kn和Km+Kn表示数的下限。
The complete bipartite graph Km1.m2. product Km× Kn and sum Km＋Kn are discussed here.The upper bound of Km1.m2 is worked out, and accordingly, lessened. The lower bound of both Km× Kn and Km＋Kn are also obtained.
出处
《长春工业大学学报》
CAS
2007年第1期95-98,共4页
Journal of Changchun University of Technology
关键词
图
图的模n表示
表示数
graph
representation of graph modulo n
representation number
