𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Different capacities of a digraph

✍ Scribed by Anna Galluccio; Luisa Gargano; János Körner; Gábor Simonyi

Book ID
105677093
Publisher
Springer Japan
Year
1994
Tongue
English
Weight
942 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Capacity of Digraphs
On the Capacity of Digraphs
✍ Noga Alon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 76 KB

For a digraph G = (V, E) let w(G n ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair It is also shown that for every n there is a tournament T on 2n vertices whose capacity is at least √ n, whereas the maximum number of vertices in a transitive subtourna

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

The skew energy of a digraph
The skew energy of a digraph
✍ C. Adiga; R. Balakrishnan; Wasin So 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 153 KB
On independent circuits of a digraph
On independent circuits of a digraph
✍ S. Rao Kosaraju 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract If every three circuits of a digraph have a common vertex, then all the circuits have one.