http://iet.metastore.ingenta.com
1887

Products of graph projections as a model for multistage communication networks

MyBook is a cheap paperback edition of the original book and will be sold at uniform, low price.
Buy article PDF
$23.94
Buy Knowledge Pack
10 articles for $144.00

Abstract

The multistage graph provides an underlying structure for conventional telephone networks (the number of ‘stages’ in practice being about seven). A systematic analysis in terms of channel graphs and terminal graphs is carried Out using products of graph projections. A unified theory emerges, and facilitates the synthesis and study of multistage switched networks of high connectivity.

References

    1. 1)
      • K.W. Cattermole . Class of communication networks with optimal connectivity. Electron. Lett. , 316 - 318
    2. 2)
      • K.W. Cattermole . Bipartite networks with optimal connectivity. Electron. Lett. , 385 - 388
    3. 3)
      • K.W. Cattermole . Graph theory and the telecommunications network. Bull. IMA , 94 - 106
    4. 4)
      • S. Maclane . (1971) , Categories for the working mathematician.
    5. 5)
      • B.R. Myers . Class of optimal damage-resistant communication nets. Electron. Lett. , 285 - 286
    6. 6)
      • K. Takagi . Design of multi-stage systems by means of optimum channel graphs. Electron. & Commum. Japan , 37 - 46
    7. 7)
      • Waller, D.A.: `Pullbacks in the category of graphs', Proceedings of 5th british combinatorial conference, aberdeen, 1975, 1976, 15, Utilitias Mathematics Publishing Inc., Winnipeg, Man., p. 637–642, Congressus Numerantium.

Related content

content/journals/10.1049/el_19760159
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address