Upper bounds on the broadcast function using minimum dominating sets

DOI10.1016/J.DISC.2012.06.016MaRDI QIDQ456886zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Arthur L. Liestman

Publication date 16 October 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.06.016

zbMATH Keywords

dominationbroadcast functiondomatic numberKnödel graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• New lower bounds on broadcast function
• General bounds on limited broadcast domination
• scientific article; zbMATH DE number 2109329
• Improved upper and lower bounds for \(k\)-broadcasting
• On the upper broadcast domination number.

Cites work

• scientific article; zbMATH DE number 425998 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A Note on the Dimensionality of Modified Knödel Graphs
• A minimum broadcast graph on 63 vertices
• A survey of gossiping and broadcasting in communication networks
• A survey on Knödel graphs.
• An Efficient Vertex Addition Method for Broadcast Networks
• Complete rotations in Cayley graphs
• Compound constructions of broadcast networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Improved upper and lower bounds for \(k\)-broadcasting
• Methods and problems of communication in usual networks
• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• Minimum multiple message broadcast graphs
• More broadcast graphs
• New gossips and telephones
• On the domination number of Knödel graph \(W_{3,n}\)
• On the minimum path problem in Knödel graphs
• On the monotonicity of the broadcast function
• Sparse broadcast graphs
• The spectra of Knödel graphs
• Tight Bounds on Mimimum Broadcast Networks
• Towards a theory of domination in graphs

Cited in

(21)

• General bounds on limited broadcast domination
• scientific article; zbMATH DE number 7021368 (Why is no real title available?)
• Binary linear programming models for robust broadcasting in communication networks
• Tight lower bounds on broadcast function for n = 24 and 25
• The shortest path problem in the Knödel graph
• Diameter of General Knödel Graphs
• Domination in Kn\"odel Graphs
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
• On the monotonicity of the broadcast function
• New lower bounds on broadcast function
• Diametral broadcast graphs
• The complexity of finding a broadcast center
• A new construction of broadcast graphs
• Efficient construction of broadcast graphs
• On broadcast schemes of Knödel graphs
• New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Efficient broadcast trees for weighted vertices
• Total domination in cubic Knodel graphs

This page was built for publication: Upper bounds on the broadcast function using minimum dominating sets

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