首页> 外文会议>International Conference on 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

机译:均匀的Partite指示了图形花圈乘积的重要形分

获取原文

摘要

In this paper, some necessary and sufficient conditions for the existence of an evenly partite directed bigraph (K_(p,q{direct+}q)) factorization in the product graphs (C_m o K_n)~* and (K_m o K_n)~*, for m ≥ 3, n, p, q ≥ 2 are obtained.
机译:在本文中,在产品图表(C_M O K_N)〜*和(k_m o k_n)〜*中存在均匀兼向的偏执的大型(k_(p,q {direct +} q))的一些必要和充分条件。 ,对于M≥3,n,p,q≥2。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号