Broadcast time and connectivity

Authors:
Nicolas Lichiardopol
Affiliations:
13S, ESSI, 930, Route des Colles, BP 145, Sophia Antipolis 06903, France
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 2
Cited 0

Broadcasting and spanning trees in de Bruijin and Kautz networks

Discrete Applied Mathematics - Special double volume: interconnection networks
Extremal Graph Theory

Extremal Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

First, we give an upper bound on the broadcast time of a graph, then a new sufficient condition to have a broadcast graph. This condition will yield numerous broadcast graphs.