Label-connected graphs and the gossip problem
- 19 January 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 87 (1) , 29-40
- https://doi.org/10.1016/0012-365x(91)90068-d
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Problem with TelephonesSIAM Journal on Algebraic Discrete Methods, 1981
- Further gossip problemsDiscrete Mathematics, 1980
- Efficiency of dissemination of information in one-way and two-way communication networksBehavioral Science, 1974
- The communication problem on graphs and digraphsJournal of the Franklin Institute, 1974
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961