摘要
证明当ｎ≥２５时，ｎ阶优美图的最多边数ｆ（ｎ）＜（ｎ２）－ｎ．
In this paper, we prove that the maximum number of edges of a graceful graph of order n, f(n)<(n2)-n, if n≥25, and discuss the gracefulness of complement of cycle.
出处
《华东交通大学学报》
1997年第1期76-78,共3页
Journal of East China Jiaotong University
关键词
图
优美图
优美标号
圈
补图
graph
graceful graph
graceful labeling
cycles
complement of graph
