The e-mail gossip number and the connected domination number

DOI10.1016/S0893-9659(97)00052-9MaRDI QIDQ1372291zbMATH OpenFDO

Authors Frank Harary, Balaji Raghavachari

Publication date 16 March 1998

Published in Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

connected domination numbere-mail gossip number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Label-connected graphs and the gossip problem
• Some minimum gossip graphs
• Quick gossiping by telegraphs

Cites work

• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Parallel concepts in graph theory

Cited in

(1)

• Message and time efficient multi-broadcast schemes

This page was built for publication: The e-mail gossip number and the connected domination number

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