首页> 外文期刊>Graphs and combinatorics >Nonisomorphic Maximum Packing and Minimum Covering of K_v with 8-Cycles
【24h】

Nonisomorphic Maximum Packing and Minimum Covering of K_v with 8-Cycles

机译:具有8个环的K_v的非同构最大填充和最小覆盖

获取原文
获取原文并翻译 | 示例
           

摘要

The maximum packing C _8-max PD(v) and minimum covering C _8-minCD(v) of K _v with 8-cycles are studied, all structures with the nonisomorphic leave (excess) are presented. In Li et al. (Graphs Combin 25:735-752, 2009), C_8-max PD(v) and C_8-minCD(v) have been determined for odd v. In this paper, we introduce the enumeration of nonisomorphic (v,v/2+s)-graphs (s = 4, 6), give complete solution of the maximum packing and minimum covering designs of K_v with 8-cycles for any even v with all possible leaves (excesses).
机译:研究了具有8个循环的K _v的最大堆积C _8-max PD(v)和最小覆盖C _8-minCD(v),给出了所有具有非同构离开(过量)的结构。在李等人。 (图表Combin 25:735-752,2009),确定了奇数v的C_8-max PD(v)和C_8-minCD(v)。在本文中,我们介绍了非同构(v,v / 2 + s)-图(s = 4,6),给出了具有所有可能叶片(多余)的任何偶数v的8圈K_v的最大包装和最小覆盖设计的完整解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号