𝔖 Bobbio Scriptorium
✦   LIBER   ✦

S̄k-factorization of symmetric complete tripartite digraphs

✍ Scribed by Kazuhiko Ushio

Book ID
108316384
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
78 KB
Volume
211
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evenly partite star-factorization of sym
Evenly partite star-factorization of symmetric complete tripartite multi-digraphs
✍ Kazuhiko Ushio 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 241 KB

We show that a necessary and sufficient condition for the existence of an \(\bar{S}_{2 q+1}\) - factorization of the symmetric complete tripartite multi-digraph \(\lambda K_{n_{1}, n_{2}, n_{3}}^{*}\) is (i) \(n_{1}=n_{2}=n_{3}\) for \(q=1\) and (ii) \(n_{1}=n_{2}=n_{3} \equiv 0(\bmod (2 q+1) q / d)

Star-factorization of symmetric complete
Star-factorization of symmetric complete bipartite digraphs
✍ Kazuhiko Ushio 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 174 KB

We show that a necessary and sufficient condition for the existence of an Sk-factorization of the symmetric complete bipartite digraph K\*, is m = n -~ 0 (mod k(k -1)).

Isomorphic factorization of the complete
Isomorphic factorization of the complete graph into Cayley digraphs
✍ G. L. Chia; Poh-Hwa Ong 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on

The isomorphic factorization of complete
The isomorphic factorization of complete tripartite graphs K (m, n, s) - a proof of F. Harary, R.W. Robinson and N.C. Wormald's conjecture
✍ Shihui Yang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Harary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K(m,n,s) if t = 2 or 4 and tl(mn + ms + ns), then G has an isomorphic factorization into t isomorphic subgraphs, written as t[ G. They also proved that the analogous statement is false for all odd t > 1. They conject