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
2-isomorphic admittance algebra applications b₁ Boolean capacitors Chapter chords circuit matrix coefficient cofactor complete tree connected graph connection matrix considered contact network corresponding current and voltage current drivers cut-set matrix defined deleting diagonal directed graph driving-point dual dual graphs edge train electrical network example follows fundamental system G₁ G1 and G2 G₂ graph G graph of Fig graph theory Hence incidence matrix inductors input Kirchhoff's current Lemma linear combination linear vector space linearly independent loop and node minimal mutual inductances N₁ network element network of Fig network theory node-admittance matrix node-pair nonoriented nonsingular submatrices notation nullity number of edges orientation partitioned path permutation planar planar graphs positive definite Postulate N3 Problem procedure Prove rank realization reference vertex result rows and columns self-loop shown in Fig subgraph submatrix system of equations terminal terminal-pair network topological formulas transformation V₁(s variables vector space voltage drivers