𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distances, diameters and verisimilitude of theories

✍ Scribed by Giangiacomo Gerla

Publisher
Springer
Year
1992
Tongue
English
Weight
499 KB
Volume
31
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Distances and diameters on iterated cliq
Distances and diameters on iterated clique graphs
✍ Miguel A. PizaΓ±a πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 203 KB

If G is a graph, its clique graph, K(G), is the intersection graph of all its (maximal) cliques. Iterated clique graphs are then deΓΏned recursively by: K We study the relationship between distances in G and distances in K n (G). Then we apply these results to Johnson graphs to give a shorter and si

Connectivity and diameter in distance gr
Connectivity and diameter in distance graphs
✍ Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 111 KB
The Diameter and Average Distance of Sup
The Diameter and Average Distance of Supertoroidal Networks
✍ R.N. Draper; V. Faber πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 1010 KB

The subject of this paper is a family of network topologies which are intended to be practical enough to be implemented in a parallel computer using contemporary technology. These network topologies offer an alternative to the three-dimensional mesh or toroid and are most likely to be useful for a n