摘要
本文构造了桥梁图Q(2n:k),并对其优美性进行了讨论,得到当n≥3k时,Q(2n:k)是优美图,并提出了一个猜想。
The essay constructs k -bridge graphs, and Studies its gracefulness. The conclusion is that, if n>3k, then k -bridge graphs, Q (2n; k) is graceful.
出处
《华东交通大学学报》
1993年第2期35-38,共4页
Journal of East China Jiaotong University
关键词
优美图
k-桥梁图
桥
graceful graph: k -bridge graphs
