Abstract
The paper develops a strictly mathematical unified theory of combinational switching networks of various types, with the aid of linear graph theory and lattice algebra. The switching net serves as the basic concept; it is defined as a directed, linear graph, the branches of which are weighted by elements of a distributive lattice. Similarly to the application of Boolean matrix theory to the study of relay-contact networks, the theory of switching nets makes use of a more general lattice matrix calculus. The paper includes, besides some new results, suitably modified, purely mathematical versions of known theorems on electrical contact networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
