首页> 外文会议>情報処理学会全国大会 >Balanced C_(24)-t-Foil Decomposition Algorithm of Complete Graphs
【24h】

Balanced C_(24)-t-Foil Decomposition Algorithm of Complete Graphs

机译:完备图的平衡C_(24)-t-箔分解算法

获取原文
获取外文期刊封面目录资料

摘要

Let K_n denote the complete graph of n vertices. Let C_(24) be the 24-cycle. The C_(24)-t-foil is a graph of t edge-disjoint C_(24)'s with a common vertex and the common vertex is called the center of the C_(24)-t-foil In particular, the C_(24)-2-foil and the C_(24)-3-foil are called the C_(24)-bowtie and the C_(24)-trefoil, respectively. When K_n is decomposed into edge-disjoint sum of C_(24)-t-foils, it is called that K_n has a C_(24)-t-foil decomposition. Moreover, when every vertex of K_n appears in the same number of C_(24)-t-foils, it is called that K_n has a balanced C_(24)-t-foil decomposition and this number is called the replication number.
机译:令K_n表示n个顶点的完整图。令C_(24)为24循环。 C_(24)-t箔是具有共同顶点的t个边缘不相交的C_(24)的图,并且该共同顶点称为C_(24)-t箔的中心,特别是C_ (24)-2-箔和C_(24)-3-箔分别称为C_(24)-领结和C_(24)-三叶。当K_n分解为C_(24)-t-箔的边不相交之和时,称为K_n具有C_(24)-t-箔的分解。此外,当K_n的每个顶点出现在相同数目的C_(24)-t-箔中时,称为K_n具有平衡的C_(24)-t-箔分解,并且该数称为复制数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号