## Zoologist: A Monthly Journal of Natural History |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Basic Concepts | 1 |

Circuits and CutSets | 19 |

Nonseparable Planar and Dual Graphs | 35 |

Copyright | |

10 other sections not shown

### Common terms and phrases

2-isomorphic admittance algebra applications Boolean capacitors Chapter chords circuit matrix coefficients cofactor common-terminal complement complete tree computation concept connected graph connection matrix considered contact network corresponding cut-set matrix defined deleting determinant directed graph discussion driving-point dual dual graphs edge train edges of G electrical network example follows fundamental system given graph G graph of Fig graph theory Hence incidence matrix inductors input Lemma linear combination linear graph linear vector space linearly independent minimal mutual inductances network of Fig network theory node-admittance matrix nonseparable graph nonsingular submatrices notation nullity number of edges orientation orthogonal P-set partitioned path permutation planar planar graphs positive definite postulates Problem procedure Prove rank real numbers realization reference vertex resistors result self-loop sequential machines shown in Fig signal-flow graph subgraph submatrix system of equations terminal terminal-pair network tion topological formulas transformation variables vector space zeros of transmission