Bumby, Richard T. A problem with telephones. (English) Zbl 0499.05034 SIAM J. Algebraic Discrete Methods 2, 13-18 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 28 Documents MSC: 05C35 Extremal problems in graph theory 05C38 Paths and cycles 05C40 Connectivity Keywords:4-cycle; gossip problem PDF BibTeX XML Cite \textit{R. T. Bumby}, SIAM J. Algebraic Discrete Methods 2, 13--18 (1981; Zbl 0499.05034) Full Text: DOI OpenURL Online Encyclopedia of Integer Sequences: Gossip Problem: there are n people and each of them knows some item of gossip not known to the others. They communicate by telephone and whenever one person calls another, they tell each other all that they know at that time. How many calls are required before each gossip knows everything? References: [1] Baker, Brenda; Shostak, Robert, Gossips and telephones, Discrete Math., 2, 191, (1972) · Zbl 0245.05002 [2] Guy, R., Monthly research problems, 1969–75, Amer. Math. Monthly, 82, 995, (1975) · Zbl 0334.00006 [3] Hajnal, A.; Milner, E. C.; Szemerédi, E., A cure for the telephone disease, Canad. Math. Bull., 15, 447, (1972) · Zbl 0251.05132 [4] Harary, Frank; Schwenk, AllenJ., The communication problem on graphs and digraphs, J. Franklin Inst., 297, 491, (1974) · Zbl 0307.05118 [5] Harary, F.; Schwenk, A. J., Efficiency of dissemination of information in one-way and two-way communictation networks, Behavioral Science, 19, 133, (1974) [6] Kleitman, D. J.; Shearer, J. B., Further gossip problems, Discrete Math., 30, 151, (1980) · Zbl 0444.05015 [7] Tijdeman, R., On a telephone problem, Nieuw Arch. Wisk. (3), 19, 188, (1971) · Zbl 0226.05001 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.