Tight lower bounds on broadcast function for \(n = 24\) and 25
type: Item
instance of: scholarly article
title: Tight lower bounds on broadcast function for \(n = 24\) and 25
zbMATH Open document ID: 1298.05291
author: Georgy Barsky
author: Hovhannes A. Harutyunyan
author: Hayk Grigoryan
published in: Discrete Applied Mathematics
publication date: 2014-08-26T00:00:00Z
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6334404
zbMATH Keywords: broadcasting
zbMATH Keywords: minimum broadcast graphs
zbMATH Keywords: broadcast function
MaRDI profile type: Publication
full work available at URL: j.dam.2014.05.018
OpenAlex ID: W2085363133
cites work: Antepenultimate broadcasting
cites work: Sparse broadcast graphs
cites work: The broadcast function value \(B(23)\) is \(33\) or \(34\).
cites work: Compound constructions of broadcast networks
cites work: Minimum broadcast graphs
cites work: On the construction of minimal broadcast networks
cites work: An Efficient Vertex Addition Method for Broadcast Networks
cites work: More broadcast graphs
cites work: Upper bounds on the broadcast function using minimum dominating sets
cites work: A minimum broadcast graph on 63 vertices
cites work: Some minimum broadcast graphs
cites work: Q3895500
cites work: Lower bounds for the size in four families of minimum broadcast graphs
cites work: Time-relaxed broadcasting in communication networks
cites work: On time-relaxed broadcasting networks
cites work: A 1-relaxed minimum broadcast graph on 15 vertices.
cites work: A minimum broadcast graph on 26 vertices
DOI: 10.1016/J.DAM.2014.05.018
description: scientific article; zbMATH DE number 6334404