More broadcast graphs
type: Item
instance of: scholarly article
title: More broadcast graphs
zbMATH Open document ID: 0936.05059
DOI: 10.1016/S0166-218X(99)00108-0
author: Hovhannes A. Harutyunyan
author: Arthur L. Liestman
published in: Discrete Applied Mathematics
publication date: 2000-05-08T00:00:00Z
review text: Let \(G\) be a graph. Broadcasting in \(G\) is the process of spreading information from one vertex, which knows the information, throughout \(G\) so that, in each time unit, any vertex which knows the information can pass it to at most one of its neighbours. Denote by \(B(n)\) the minimum number of edges over all graphs of order \(n\) which allow any vertex to broadcast in time \(\left\lceil \log n\right\rceil \). In the paper a new upper bound on \(B(n)\) is provided for some values of \(n\).
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1389500
zbMATH Keywords: broadcast graph
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Q5689764
cites work: Antepenultimate broadcasting
cites work: A Note on the Dimensionality of Modified Knödel Graphs
cites work: Sparse broadcast graphs
cites work: Broadcasting in Bounded Degree Graphs
cites work: Q3474496
cites work: Q4038748
cites work: Compound constructions of broadcast networks
cites work: Minimal broadcast networks
cites work: Minimum broadcast graphs
cites work: On the construction of minimal broadcast networks
cites work: Tight Bounds on Mimimum Broadcast Networks
cites work: A survey of gossiping and broadcasting in communication networks
cites work: New gossips and telephones
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: A new method for constructing minimal broadcast networks
full work available at URL: s0166-218x(99)00108-0
OpenAlex ID: W2166684835
description: scientific article; zbMATH DE number 1389500