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

T-graphs and the channel assignment problem

โœ Scribed by Daphne Der-Fen Liu

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
445 KB
Volume
161
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Channel assignment on Cayley graphs
Channel assignment on Cayley graphs
โœ Patrick Bahls ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 100 KB

We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if G is the Cayley graph of an n-generated group with a certain kind of presentation, then (G; k, 1) โ‰ค 2(k +n-1). F

A channel assignment problem for optical
A channel assignment problem for optical networks modelled by Cayley graphs
โœ Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

A problem arising from a recent study of scalability of optical networks seeks to assign channels to the vertices of a network so that vertices distance 2 apart receive distinct channels. In this paper we introduce a general channel assignment scheme for Cayley graphs on abelian groups, and derive u

Graph labeling and radio channel assignm
Graph labeling and radio channel assignment
โœ van den Heuvel, J.; Leese, R. A.; Shepherd, M. A. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 438 KB

The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels. As a model for the way in which interference is avoided in real radio systems, e