Label-connected graphs and the gossip problem

DOI10.1016/0012-365X(91)90068-DMaRDI QIDQ804593zbMATH OpenFDO

Authors N. E. Zubov

Publication date 1991

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

label-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99)

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

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Problem with Telephones
• Edge-Disjoint Spanning Trees of Finite Graphs
• Further gossip problems
• Graph theory
• On the Problem of Decomposing a Graph into n Connected Factors
• The communication problem on graphs

Cited in

(6)

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

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)