The communication problem on graphs

DOI10.1016/0016-0032(74)90126-4zbMath0307.05118OpenAlexW2010254555MaRDI QIDQ1217715

Frank Harary, Allen J. Schwenk

Publication date: 1974

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(74)90126-4

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (19)

Telephone Problems with Failures ⋮ A Problem with Telephones ⋮ Quick gossiping without duplicate transmissions ⋮ Propositional gossip protocols ⋮ Kernels of minimum size gossip schemes ⋮ The partial gossiping problem ⋮ Reordered gossip schemes ⋮ Dynamic gossip ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ The epistemic gossip problem ⋮ A class of solutions to the gossip problem. I ⋮ Epistemic protocols for dynamic gossip ⋮ Set to set broadcasting in communication networks ⋮ Gossips and telegraphs ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Toward optimal gossiping schemes with conference calls ⋮ A class of solutions to the gossip problem. III ⋮ The number of rounds needed to exchange information within a graph ⋮ Label-connected graphs and the gossip problem

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Gossips and telephones
• A Cure for the Telephone Disease

This page was built for publication: The communication problem on graphs