Zoologist: A Monthly Journal of Natural History |
Contents
Problems | 1 |
NONSEPARABLE PLANAR AND DUAL GRAPHS | 35 |
CHAPTER 4 | 53 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
algebra applications basis branches Chapter chords circuit circuit matrix coefficient columns combination common complete computation concept connected connected graph considered consisting contains convention corresponding cut-set cut-set matrix defined DEFINITION deleting dependent determinant directed graph discussion drivers dual edge elements entries equations equivalent establish example exists expressed follows formulas functions fundamental G₁ given graph graph G Hence incidence matrix included independent input interest Kirchhoff's known least linear loop major minimal node nonsingular nonzero obtained operations orientation original partitioned path positive possible postulates Problem procedure proof properties Prove rank realization reference relation removed result rows satisfying separable shown in Fig solution space subgraph submatrix system of equations terminal terminal-pair Theorem theory tion topological transformation tree variables vector vertex vertices voltage weight zero