Decompositions of complete digraphs into small tripartite digraphs

Bunge Ryan C.; Cowan Camry J.; Cross Laban J.; El-Zanati Saad I.; Hart Annie E.; Roberts Dan P.; Youngblood Asia M.

首页> 外文期刊>The Journal of Combinatorial Mathematics and Combinatorial Computing >Decompositions of complete digraphs into small tripartite digraphs

【24h】

Decompositions of complete digraphs into small tripartite digraphs

机译：将完整有向图分解为小三方有向图

获取原文

获取原文并翻译 | 示例

开具论文收录证明 >>

页面导航

摘要
著录项
引文网络
相似文献
相关主题

摘要

Necessary and sufficient conditions on n are established for the existence of a (Kn∗, D)-design where D is any digraph obtained by orienting the edges of a triangle with a pendant edge.

机译：为存在（Kn ∗，D）设计建立了n上的充要条件，其中D是通过使三角形的边沿具有垂线边缘定向而得到的任何有向图。

著录项

来源
《The Journal of Combinatorial Mathematics and Combinatorial Computing》 |2017年第8期|239-251|共13页
作者
Bunge Ryan C.; Cowan Camry J.; Cross Laban J.; El-Zanati Saad I.; Hart Annie E.; Roberts Dan P.; Youngblood Asia M.;
展开▼
作者单位

Illinois State University, Normal, IL, United States;

Missouri State University, Springfield, MO, United States;

Tri-Valley High School, Downs, IL, United States;

Illinois State University, Normal, IL, United States;

University of Illinois, Champaign, IL, United States;

Illinois Wesleyan University, Bloomington, IL, United States;

Michigan State University, East Lansing, MI, United States;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length [J] . Shyu Tay-Woei Graphs and combinatorics . 2015,第5期

机译：将完全二部图和完全图分解为固定偶数长度的有向路径和有向环
2. K_(p,q)-factorization of symmetric complete tripartite digraphs [J] . Kazuhiko Ushio, Yoshikazu Ohtsubo Discrete mathematics . 2001,第1a3期

机译：对称完全三方有向图的K_（p，q）分解
3. (S-bar)_k-factorization of symmetric complete tripartite digraphs [J] . Kazuhiko Ushio Discrete mathematics . 2000,第1a3期

机译：（S-bar）_k对称完全三方有向图的k因式分解
4. Balanced bowtie decomposition algorithm of symmetric complete tripartite multi-digraphs [C] . Kazuhiko Ushio, Hideaki Fujimoto 情報処理学会全国大会 . 2001

机译：对称完全三方图的平衡领结分解算法
5. Computational complexity of digraph decomposition and the congruence extension property for algebras. [D] . Becker, Joy Lynne. 2002

机译：有向图分解的计算复杂度和代数的同余扩展性质。
6. Threshold Digraphs [O] . Brian Cloteaux, M. Drew LaMar, Elizabeth Moseman, 2014

机译：门限图
7. Ǩp,q-factorization of symmetric complete tripartite digraphs [O] . Ushio Kazuhiko, Ohtsubo Yoshikazu 2001

机译：对称完全三方有向图的Ǩp，q因式分解
8. Strong K-Connectivity in Digraphs and Random Digraphs [R] . Reif, J. H., Spirakis, P. G. 1981

机译：有向图和随机有向图中的强K连通性

Decompositions of complete digraphs into small tripartite digraphs

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅