摘要
研究了有向图mn的优美性,利用搜索图的标号的算法与数学证明相结合的方法,证明了有向图4n为优美图,其中n为任意正整数.
This paper researches the gracefulness of digraph m-→C n. By utilizing algorithm of searching for graph labeling and combining with mathematical proof, this paper proves that digraph 4-→C n is graceful for any positive integer n.
出处
《纯粹数学与应用数学》
CSCD
2014年第5期543-550,共8页
Pure and Applied Mathematics
基金
国家自然科学基金(61262018)
关键词
有向图
有向圈
优美图
优美标号
digraph
directed cycles
graceful graph
graceful labeling
