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

Representations and routing for Cayley graphs [computer networks]

โœ Scribed by Arden, B.W.; Tang, K.W.


Book ID
117860476
Publisher
IEEE
Year
1991
Tongue
English
Weight
483 KB
Volume
39
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Routing in computer networks
โœ H. Frank; W. Chou ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 607 KB
A channel assignment problem for optical
โœ 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