𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Residual properties of pre-bipartite digraphs

✍ Scribed by Belinda Trotta

Publisher
Springer
Year
2010
Tongue
English
Weight
356 KB
Volume
64
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

Connectivity of large bipartite digraphs
Connectivity of large bipartite digraphs and graphs
✍ M.C. Balbuena; A. Carmona; J. FΓ brega; M.A. Fiol πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 638 KB

This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu