Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars

Robert Gardner, Kazeem Kosebinu
{"title":"Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars","authors":"Robert Gardner, Kazeem Kosebinu","doi":"10.3390/appliedmath4010011","DOIUrl":null,"url":null,"abstract":"Graph and digraph decompositions are a fundamental part of design theory. Probably the best known decompositions are related to decomposing the complete graph into 3-cycles (which correspond to Steiner triple systems), and decomposing the complete digraph into orientations of a 3-cycle (the two possible orientations of a 3-cycle correspond to directed triple systems and Mendelsohn triple systems). Decompositions of the λ-fold complete graph and the λ-fold complete digraph have been explored, giving generalizations of decompositions of complete simple graphs and digraphs. Decompositions of the complete mixed graph (which contains an edge and two distinct arcs between every two vertices) have also been explored in recent years. Since the complete mixed graph has twice as many arcs as edges, an isomorphic decomposition of a complete mixed graph into copies of a sub-mixed graph must involve a sub-mixed graph with twice as many arcs as edges. A partial orientation of a 6-star with two edges and four arcs is an example of such a mixed graph; there are five such mixed stars. In this paper, we give necessary and sufficient conditions for a decomposition of the λ-fold complete mixed graph into each of these five mixed stars for all λ>1.","PeriodicalId":503400,"journal":{"name":"AppliedMath","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AppliedMath","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/appliedmath4010011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Graph and digraph decompositions are a fundamental part of design theory. Probably the best known decompositions are related to decomposing the complete graph into 3-cycles (which correspond to Steiner triple systems), and decomposing the complete digraph into orientations of a 3-cycle (the two possible orientations of a 3-cycle correspond to directed triple systems and Mendelsohn triple systems). Decompositions of the λ-fold complete graph and the λ-fold complete digraph have been explored, giving generalizations of decompositions of complete simple graphs and digraphs. Decompositions of the complete mixed graph (which contains an edge and two distinct arcs between every two vertices) have also been explored in recent years. Since the complete mixed graph has twice as many arcs as edges, an isomorphic decomposition of a complete mixed graph into copies of a sub-mixed graph must involve a sub-mixed graph with twice as many arcs as edges. A partial orientation of a 6-star with two edges and four arcs is an example of such a mixed graph; there are five such mixed stars. In this paper, we give necessary and sufficient conditions for a decomposition of the λ-fold complete mixed graph into each of these five mixed stars for all λ>1.
将 λ 折叠完整混合图分解为混合六星图
图和数图分解是设计理论的基本组成部分。最著名的分解可能是将完整图分解为 3 个循环(对应于斯坦纳三重系统),以及将完整数图分解为 3 个循环的方向(3 个循环的两个可能方向对应于有向三重系统和门德尔松三重系统)。我们还探索了 λ 折叠完整图和 λ 折叠完整数图的分解,给出了完整简单图和数图分解的一般化。近年来,人们还探索了完整混合图(每两个顶点之间包含一条边和两条不同的弧)的分解。由于完整混合图的弧数是边数的两倍,因此将完整混合图分解为子混合图副本的同构分解必须涉及弧数是边数两倍的子混合图。具有两条边和四条弧的 6 星图的部分定向就是这种混合图的一个例子;共有五个这样的混合星图。在本文中,我们给出了在所有 λ>1 条件下,将 λ 折叠完整混合图分解为这五个混合星的必要条件和充分条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信