摘要
把由m个n回路Cn恰好有p条相邻的公共边构成的图记为Cn,m,p,证明了图C8,n,4和C4n,8,2n都是K—优美图。
In this paper, Cn,m,p denotes a graph that is composed by m loops Cn which has p common edges,and we prove that C8,n,4 and C4n,8,2n are both K—graceful.
出处
《山东建筑工程学院学报》
1998年第2期84-86,共3页
Journal of Shandong Institute of Architecture and Engineering