Answers are grounded in this paper and cite their sources.
What is the minimum number of edges that a graph on n vertices must have to allow gossiping by bidirectional telephone calls within ⌈log2 n⌉ rounds? Besides general estimates, this question is finally answered for integers of the form n = 2p − 2 (p ≥ 3) or n = 2p − 4 (p ≥ 6), and for n = 10, 12. Moreover, for n = 14, we prove the uniqueness of such a graph.
No takes yet. Share an insight, caveat, or question.
Roger Labahn (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: