Upper bounds on the broadcast function using minimum dominating sets

DOI10.1016/j.disc.2012.06.016zbMath1252.05161OpenAlexW2135113048MaRDI QIDQ456886

Arthur L. Liestman, Hovhannes A. Harutyunyan

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)

Related Items (15)

Binary linear programming models for robust broadcasting in communication networks ⋮ Unnamed Item ⋮ The complexity of finding a broadcast center ⋮ A new construction of broadcast graphs ⋮ Domination in Kn\"odel Graphs ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25 ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Diameter of General Knödel Graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Efficient construction of broadcast graphs ⋮ Diametral broadcast graphs ⋮ Efficient broadcast trees for weighted vertices ⋮ The shortest path problem in the Knödel graph ⋮ A New Construction of Broadcast Graphs ⋮ Total domination in cubic Knodel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse broadcast graphs
• New gossips and telephones
• Compound constructions of broadcast networks
• Methods and problems of communication in usual networks
• A minimum broadcast graph on 63 vertices
• A survey on Knödel graphs.
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• On the monotonicity of the broadcast function
• More broadcast graphs
• Improved upper and lower bounds fork-broadcasting
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• On the minimum path problem in Knödel graphs
• A survey of gossiping and broadcasting in communication networks
• Towards a theory of domination in graphs
• A Note on the Dimensionality of Modified Knödel Graphs
• Tight Bounds on Mimimum Broadcast Networks
• Minimum multiple message broadcast graphs
• Complete rotations in Cayley graphs

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