首页> 外文会议>Theoretical Computer Science and Discrete Mathematics >Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs
【24h】

Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs

机译:图的花圈乘积的均匀部分有向图因式分解

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

摘要

In this paper, some necessary and sufficient conditions for the existence of an evenly partite directed bigraph (K_(p,q⊕q)) factorization in the product graphs (C_m ◦ K_n)~* and (K_m ◦ K_n)~*, for m ≥ 3, n,p,q ≥ 2 are obtained.
机译:本文为产品图(C_m◦K_n)〜*和(K_m◦K_n)〜*的乘积图存在均匀的有向有向图(K_(p,q⊕q))分解提供了一些充要条件。 m≥3,得到n,p,q≥2。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号