摘要
在当今网络研究中,人们需要将某些特殊的图分解为指定的结构.优美图可以被运用到图分解中.得到一些构造优美图的可算法化的方法,并构造较为复杂的优美图.
It has been known that the decomposition of graphs is very important in research of current networks. Moreover, graceful graphs have been used to decompose some graphs. We discover some methods that can be used to construct larger scale of graceful graphs from smaller graceful graphs, and furthermore the methods can be transformed into algorithms.
出处
《数学的实践与认识》
CSCD
北大核心
2014年第1期157-162,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金(61163054
61163037)
关键词
树
优美标号
优美图
tree
graceful labelling
graceful graph
