𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum k-broadcast graphs

✍ Scribed by J.-C. König; E. Lazard

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
647 KB
Volume
53
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum multiple message broadcast graph
Minimum multiple message broadcast graphs
✍ Hovhannes A. Harutyunyan 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

Multiple message broadcasting is the process of multiple message dissemination in a communication network in which m messages, originated by one vertex, are transmitted to all vertices of the network. A graph G with n vertices is called a m-message broadcast graph if its broadcast time is the theore

A minimum broadcast graph on 26 vertices
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

Minimum K-hamiltonian graphs
Minimum K-hamiltonian graphs
✍ W. W. Wong; C. K. Wong 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB
Minimum k-hamiltonian graphs, II
Minimum k-hamiltonian graphs, II
✍ M. Paoli; W. W. Wong; C. K. Wong 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

We consider in this paper graphs which remain hamiltonian after the removal of k edges (k-edge hamiltonian) or k vertices (k-hamiltonian). These classes of graphs arise from reliability considerations in network design. In a previous paper, W. W. Wong and C. K. Wong presented families of minimum k-h