𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The communication problem on graphs and digraphs

✍ Scribed by Frank Harary; Allen J. Schwenk

Book ID
107755431
Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
372 KB
Volume
297
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Digraph extremal problems, hypergraph ex
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
✍ W.G Brown; M Simonovits πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o

On the distance connectivity of graphs a
On the distance connectivity of graphs and digraphs
✍ M.A. Fiol; J. FΓ brega πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 475 KB

Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be