Farley, Arthur; Hedetniemi, Stephen; Mitchell, Sandra; Proskurowski, Andrzej Minimum broadcast graphs. (English) Zbl 0404.05038 Discrete Math. 25, 189-193 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 39 Documents MSC: 05C35 Extremal problems in graph theory 05C99 Graph theory Keywords:Minimum Broadcast Graphs; Broadcast Time; Connected Broadcast Graph; Communication Lines; Minimal Broadcast Graph PDF BibTeX XML Cite \textit{A. Farley} et al., Discrete Math. 25, 189--193 (1979; Zbl 0404.05038) Full Text: DOI OpenURL References: [1] E. Cockayne and S. Hedetniemi, A conjecture concerning broadcasting in m-dimensional grid graphs, CS-TR-78-14, Computer Science Department, University of Oregon. [2] A. Farley, Minimal broadcast networks, Networks, to appear. · Zbl 0425.94025 [3] Farley, A.M.; Hedetniemi, S.T., Broadcasting in grid graphs, (), to appear. · Zbl 0427.94044 [4] A. Farley, S. Hedetniemi, S. Mitchell and A. Proskurowski, Minimum broadcast graphs, CS-TR- 77-2, Computer Science Department, University of Oregon. · Zbl 0404.05038 [5] S.T. Hedetniemi and S. Mitchell, A census of minimum broadcast graphs, CS-TR-78-7, Computer Science Department, University of Oregon, submitted. · Zbl 0449.05034 [6] A. Proskurowski, Minimum broadcast trees, CS-TR-78-18, Computer Science Department, University of Oregon. [7] P. Slater, E. Cockayne and S. Hedetniemi, Information dissemination in trees, CS-TR-78-11, Computer Science Department, University of Oregon, submitted. · Zbl 0468.68064 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.