Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person in the network knows a unique item of information and needs to communicate it to everyone else. In broadcasting, one individu
Characterizing and bounding the imperfection ratio for some classes of graphs
✍ Scribed by Sylvain Coulonges; Arnaud Pêcher; Annegret K. Wagler
- Publisher
- Springer-Verlag
- Year
- 2007
- Tongue
- English
- Weight
- 211 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we study the ultimate independence ratio I(G) of a graph G, which is defined as the limit of the sequence of independence ratios of powers of G. We construct a graph G with ultimate independence ratio I(G) strictly between the previous known upper bound 1/zz(G) and lower bound 1/x(G).
## Abstract A method is described of constructing a class of self‐complementary graphs, that includes a self‐complementary graph, containing no __K__~5~, with 41 vertices and a self‐complementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num