𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Returnability in complex directed networks (digraphs)

✍ Scribed by Ernesto Estrada; Naomichi Hatano

Book ID
104037658
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
214 KB
Volume
430
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Clustering in complex directed networks
Clustering in complex directed networks
✍ Fagiolo, Giorgio πŸ“‚ Article πŸ“… 2007 πŸ› The American Physical Society 🌐 English βš– 297 KB
Directed Triangles in Digraphs
Directed Triangles in Digraphs
✍ Jian Shen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 144 KB

Let c be the smallest possible value such that every digraph on n vertices with minimum outdegree at least cn contains a directed triangle. It was conjectured by Caccetta and Ha ggkvist in 1978 that c=1Γ‚3. Recently Bondy showed that c (2 -6&3)Γ‚5=0.3797... by using some counting arguments. In this no

Maximum directed cuts in acyclic digraph
Maximum directed cuts in acyclic digraphs
✍ Noga Alon; BΓ©la BollobΓ‘s; AndrΓ‘s GyΓ‘rfΓ‘s; JenΕ‘ Lehel; Alex Scott πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

## Abstract It is easily shown that every digraph with __m__ edges has a directed cut of size at least __m__/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of the largest directed cut in __acyclic__ digraphs, and prove a number of related results concerning cuts

Directed distance in digraphs: Centers a
Directed distance in digraphs: Centers and medians
✍ Gary Chartrand; Garry L. Johns; Songlin Tian; Steven J. Winters πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 513 KB

## Abstract The directed distance __d__~__D__~(__u, v__) from a vertex __u__ to a vertex __v__ in a strong digraph __D__ is the length of a shortest (directed) __u ‐ v__ path in __D.__ The eccentricity of a vertex __v__ in __D__ is the directed distance from __v__ to a vertex furthest from __v.__ T