๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Orthogonal Decompositions of Complete Digraphs

โœ Scribed by Sven Hartmann

Publisher
Springer Japan
Year
2002
Tongue
English
Weight
188 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Orthogonal Decomposition and Packing of
Orthogonal Decomposition and Packing of Complete Graphs
โœ Yair Caro; Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

An H-decomposition of a graph G is a partition of the edge-set of G into subsets, where each subset induces a copy of the graph H. A k-orthogonal H-decomposition of a graph G is a set of k H-decompositions of G, such that any two copies of H in distinct H-decompositions intersect in at most one edge

Applying a proof of tverberg to complete
Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
โœ Dan Pritikin ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

Graham and Pollak 121 proved that n -1 is the minimum number of edge-disjoint complete bipartite subgraphs into which the edges of K,, decompose. Tverberg 161, using a linear algebraic technique, was the first to give a simple proof of this result. We apply Tverberg's technique to obtain results for

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