Label-connected graphs and the gossip problem

DOI10.1016/0012-365X(91)90068-DzbMath0728.05040MaRDI QIDQ804593

N. E. Zubov

Publication date: 1991

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

label-connected graph

Mathematics Subject Classification ID

Graph theory (05C99) Connectivity (05C40)

Related Items (4)

Kernels of minimum size gossip schemes ⋮ Reordered gossip schemes ⋮ Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks ⋮ Connectivity and inference problems for temporal networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further gossip problems
• The communication problem on graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Problem with Telephones

This page was built for publication: Label-connected graphs and the gossip problem