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

R64-52 On the Number of Classes of [n, k] Switching Networks

โœ Scribed by Lechner, R.J.


Book ID
114587037
Publisher
Institute of Electrical and Electronics Engineers
Year
1964
Tongue
English
Weight
341 KB
Volume
EC-13
Category
Article
ISSN
0367-7508

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the number of classes of (n,k) switch
โœ Michael A. Harrison ๐Ÿ“‚ Article ๐Ÿ“… 1963 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

An (n,k) switching network is defined as all n-input, k-output network such that associated with each output is a Boolean transmission function of the n-inputs. If we allow a group @ on the inputs and a group ~ on the outputs, then the family of networks is decomposed into equivalence classes. In th

On the construction of balanced switchin
โœ F. K. Hwang; S. Lin ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 919 KB

## Abstract A balanced switching network is a multistage switching network where all channel graphs G(ฮฑ, ฮฒ) (the union of all paths from the input switch ฮฑ to the output switch ฮฒ) are isomorphic. In this paper we: (1) derive some necessary conditions for the existence of balanced switching networks

On the hull number of some graph classes
โœ Araujo, J.; Campos, V.; Giroire, F.; Nisse, N.; Sampaio, L.; Soares, R. ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 482 KB