摘要
本文在我们以往研究基础上 ,得到了有向图 n· C 3优美的进一步性质 :两个无交有向图 n· C 3各自的公共顶点与一个新增加的顶点 ,分别用有向弧来连接 ,使该新增加顶点的出度为 2或入度为 2时 。
Based on our previous paper, further property of gracefulness of digraph n·C 3 is obtained: each common vertex of two non-intersecting digraph n·C 3 connects with a new additional vertex through directional arcs. As a results, such a connection makes this digraph becomes a graceful graph when outdegree aguals to 2 or indegree aquals to 2.
出处
《数学的实践与认识》
CSCD
北大核心
2003年第2期44-47,共4页
Mathematics in Practice and Theory
关键词
有向图
优美性
顶点
回路
digraph
directed circuit
graceful labeling
