Graph Theory and Electric Networks
- 1 May 1959
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IRE Transactions on Circuit Theory
- Vol. 6 (5) , 95-109
- https://doi.org/10.1109/tct.1959.1086594
Abstract
In this discussion, we mention the following topics concerning electric networks in graph theoretic terms: Kirch. hoff's Laws, mesh and node equations, and matrix tree theorem; flow problems and Menger's theorem; boolean functions and enumeration and synthesis problems; information theory and Markov chains; cut sets and incidence matrices; the "crummy relay" results of Moore and Shannon; and the treatment using electrical concepts of the dissections of rectangles into squares by Brooks, Smith, Stone, and Tuttle. The treatment is expository, but introduces the unifying framework of graph theory for these various considerations.Keywords
This publication has 41 references indexed in Scilit:
- Series-parallel graphs and latticesDuke Mathematical Journal, 1959
- An algorithm for a minimum cover of a graphProceedings of the American Mathematical Society, 1959
- On the number of bi-colored graphsPacific Journal of Mathematics, 1958
- Maximum-Minimum Sätze über GraphenActa Mathematica Hungarica, 1958
- Algebraic Topological Methods for the Synthesis of Switching Systems. ITransactions of the American Mathematical Society, 1958
- On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a MachineJournal of the ACM, 1958
- Some Mathematical Aspects of SwitchingThe American Mathematical Monthly, 1955
- The number of linear, directed, rooted, and connected graphsTransactions of the American Mathematical Society, 1955
- Squaring the SquareCanadian Journal of Mathematics, 1950
- Sur les types des propositions composéesThe Journal of Symbolic Logic, 1940