𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cyclic gossiping times for some classes of graphs

✍ Scribed by Knisely, James A.; Laskar, Renu

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
574 KB
Volume
28
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

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 individual has an item of information which needs to be communicated to everyone else. A variation of gossiping, called cyclic gossiping, recently introduced by Liestman and Richards, is studied here for certain classes of graphs.

πŸ“œ SIMILAR VOLUMES

An Efficient Parallel Algorithm for Maxi
An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs
✍ I. Parfenoff πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi

Orderly algorithms for generating restri
Orderly algorithms for generating restricted classes of graphs
✍ Charles J. Colbourn; Ronald C. Read πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 463 KB

## Abstract Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of

A Characterization of Some Graph Classes
A Characterization of Some Graph Classes with No Long Holes
✍ E. Eschen; R. Sritharan πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 295 KB

We give a characterization of a hierarchy of graph classes with no long holes in which each class excludes some long antiholes. At one end of the hierarchy is the class of graphs with no long holes. At the other end is the class of weakly triangulated graphs. The characterization has the flavor of t

Eigenvalue bounds for some classes of P-
Eigenvalue bounds for some classes of P-matrices
✍ J. M. PeΓ±a πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 110 KB

## Abstract Eigenvalue bounds are provided. It is proved that the minimal eigenvalue of a __Z__‐matrix strictly diagonally dominant with positive diagonals lies between the minimal and the maximal row sums. A similar upper bound does not hold for the minimal eigenvalue of a matrix strictly diagonal