Abstract
We propose broadcasting algorithms for line digraphs in the telegraph model. The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph LkG, the graph obtained by applying k times, the line digraph operation to G. As a consequence improved bounds for the broadcasting time in De Bruijn, Kautz, and Wrapped Butterfly digraphs are obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
