...
首页> 外文期刊>Order >Partitioning Transitive Tournaments into Isomorphic Digraphs
【24h】

Partitioning Transitive Tournaments into Isomorphic Digraphs

机译:将传递锦标赛分区为同义形态

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

摘要

In an earlier paper (see Sali and Simonyi Eur. J. Combin.20, 93-99,1999) the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We investigate the possibilities of generalizing this theorem to decompositions of the complete graph into three or more isomorphic graphs. We find that a complete characterization of when an orientation with similar properties is possible seems elusive. Nevertheless, we give sufficient conditions that generalize the earlier theorem and also imply that decompositions of odd vertex complete graphs to Hamiltonian cycles admit such an orientation. These conditions are further generalized and some necessary conditions are given as well.
机译:在较早的纸上(见Sali和Simonyi EUR。J. Combin.20,93-99,1999)前两位作者表明,自互补图可以始终以定向版本的联盟和所指的方式定向 其正常定向的补充给出了一个及同的竞赛锦标赛。 我们研究了将本定理概括为完整图的分解成三个或更多个同构图的可能性。 我们发现,当具有相似性质的方向可能似乎难以捉摸时,似乎难以捉摸。 然而,我们提供了足够的条件,概括了早期定理,并暗示奇数顶点完整图的分解给哈密顿循环承认这种方向。 这些条件是进一步的广泛化,也给出了一些必要的条件。

著录项

  • 来源
    《Order》 |2021年第2期|211-228|共18页
  • 作者单位

    Alfred Renyi Inst Math Budapest Hungary|Budapest Univ Technol & Econ Dept Comp Sci & Informat Theory Budapest Hungary;

    Alfred Renyi Inst Math Budapest Hungary|Budapest Univ Technol & Econ Dept Comp Sci & Informat Theory Budapest Hungary;

    Alfred Renyi Inst Math Budapest Hungary|Cent European Univ Dept Math Budapest Hungary;

  • 收录信息 美国《科学引文索引》(SCI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Graph orientation; Decomposition to isomorphic graphs; Transitive tournament;

    机译:图形方向;对同构图的分解;及物锦标赛;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号