𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An estimate of the minimum diameter for a class of graphs

✍ Scribed by L. S. Lozinskii

Publisher
Springer US
Year
1974
Tongue
English
Weight
257 KB
Volume
8
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for construction of a k-con
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
✍ Ulrich Schumacher πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

An upper bound for the minimum rank of a
An upper bound for the minimum rank of a graph
✍ Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan Shader πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 137 KB
A note on estimating the diameter of a t
A note on estimating the diameter of a truncated moment class
✍ Luca Tardella πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 113 KB

The k-truncated moment class (m k ) = { ∈ P: mi = I x i (d x); i = 1; : : : ; k} of all probability distributions on a compact interval I of the real line which have the same ÿrst k moments is considered. This paper derives some remarkable properties of the ranges of (k + h)th moments which allow to