✦ LIBER ✦

A minimum broadcast graph on 63 vertices

✍ Scribed by Roger Labahn

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 207 KB
Volume: 53
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90188-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minimum broadcast graph on 26 vertices

✍ Jian-guo Zhou; Ke-min Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 246 KB

Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. A broadcast graph is a graph which permits broadcasting from any originator in minimum time. The broadcast function B(n) is

A 1-relaxed minimum broadcast graph on 1

A 1-relaxed minimum broadcast graph on 15 vertices

✍ Tianxing Yao; Guofei Zhou; Jianguo Zhou 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The number of cut-vertices in a graph of

The number of cut-vertices in a graph of given minimum degree

✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in

On the degrees of vertices in A bichroma

On the degrees of vertices in A bichromatic random graph

✍ Z. Palka 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 219 KB

On paths avoiding forbidden pairs of ver

On paths avoiding forbidden pairs of vertices in a graph

✍ Hananya Yinnone 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 473 KB

On minimum maximal independent sets of a

On minimum maximal independent sets of a graph

✍ Julie Haviland 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 638 KB