𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A 1-relaxed minimum broadcast graph on 15 vertices

✍ Scribed by Tianxing Yao; Guofei Zhou; Jianguo Zhou

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
231 KB
Volume
17
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On minimum sets of 1-factors covering a
On minimum sets of 1-factors covering a complete multipartite graph
✍ David Cariolaro; Hung-Lin Fu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. Β© 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

A note on minimum graphs with girth pair
A note on minimum graphs with girth pair (4, 2l + 1)
✍ Denis Hanson; Ping Wang; Gary Macgillivray πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 125 KB

## Abstract We show that the size of a smallest connected __k__‐regular graph with girth pair (4, 2__l__ + 1) is within a constant of (2__l__ + 1) __k__/2. In so doing we disprove a conjecture of Harary and Kovacs.