๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The number of rounds needed to exchange information within a graph

โœ Scribed by Susan F. Assmann; Daniel J. Kleitman


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
446 KB
Volume
6
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A counterexample to a conjecture on the
โœ Ulrich Teschner ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.

The place of memantine in the treatment
โœ Gill Livingston; Cornelius Katona ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 76 KB ๐Ÿ‘ 1 views

## Abstract ## Introduction Memantine is currently the only treatment approved for moderately severe to severe Alzheimer's disease (AD). There is still some discussion as to its place in clinical practice and many UK clinicians are discouraged for economic reasons from prescribing it. We adopt a โ€˜