๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The (n, k)-star graph: A generalized star graph

โœ Scribed by Chiang Wei-Kuo; Chen Rong-Jaye

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
515 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Embedding Meshes on the Star Graph
Embedding Meshes on the Star Graph
โœ S. Ranka; J.C. Wang; N. Yeh ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 362 KB

We develop algorithms for mapping \(n\)-dimensional meshes on a star graph of degree \(n\) with expansion 1 and dilation 3 . We show that an \(n\)-degree star graph can efficiently simulate an \(n\)-dimensional mesh. 1993 Academic Press, Inc.

The star chromatic number of a graph
The star chromatic number of a graph
โœ H. L. Abbott; B. Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 469 KB ๐Ÿ‘ 2 views

## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. ยฉ 1993 John Wiley & Sons, Inc.

Wormhole broadcast in star graph network
Wormhole broadcast in star graph networks
โœ Shahram Latifi; Pradip K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We propose a new broadcasting algorithm in star graph connected networks with wormhole routing. We use the usual single-port communication model with intermediate node reception capability where a node can communicate with a single neighbor at any instant of time. Lower bound under the model is deri