Label-connected graphs and the gossip problem

DOI10.1016/0012-365X(91)90068-DzbMATH Open0728.05040MaRDI QIDQ804593FDOQ804593

Authors: N. E. Zubov 

Publication date: 1991

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

Recommendations

• Some minimum gossip graphs
• The e-mail gossip number and the connected domination number
• Note on optimal gossiping in some weak-connected graphs
• Broadcast and gossip in line-communication mode
• scientific article; zbMATH DE number 3910097

zbMATH Keywords

label-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The communication problem on graphs
• Further gossip problems
• A Problem with Telephones

Cited In (6)

• Kernels of minimum size gossip schemes
• Connectivity and inference problems for temporal networks
• Reordered gossip schemes
• Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
• Temporally connected components
• The complexity of computing optimum labelings for temporal connectivity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804593)