✦ LIBER ✦

Star-factorization of symmetric complete bipartite digraphs

✍ Scribed by Kazuhiko Ushio

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 174 KB
Volume: 167-168
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00259-2

No coin nor oath required. For personal study only.

✦ Synopsis

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)).

📜 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)

A line digraph of a complete bipartite d

A line digraph of a complete bipartite digraph

✍ Juan Liu; Lin Sun; Jixiang Meng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 310 KB

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum outdegrees (d 1 , d 2 ) of its partite sets of vertices. In this work, we defi

P3-Factorization of complete bipartite g

P3-Factorization of complete bipartite graphs

✍ Kazuhiko Ushio 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 344 KB

P,-factorization of K,,,, is (i) m + n -0 (mod 3), (ii) m < 2n, (iii) n s 2m and (iv) 3mn/2(m + n) is an integer.

Balanced bipartite graphs may be complet

Balanced bipartite graphs may be completely star-factored

✍ Nigel Martin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

We conclude the study of complete K1,q-factorizations of complete bipartite graphs of the form Kn,n and show that, so long as the obvious Basic Arithmetic Conditions are satisfied, such complete factorizations must exist.

P2p-factorization of a complete bipartit

P2p-factorization of a complete bipartite graph

✍ Hong Wang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 118 KB

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