What people are saying - Write a review
We haven't found any reviews in the usual places.
SYNTHESIS OF PLANAR NPORT NETWORKS
SYNTHESIS OF PLANAR OR NONPLANAR
2 other sections not shown
2-graph algorithm basis circuits circuit labels class of graphs coded graph column combinations of pairs complement computer programming conclusion follows connected graph contain no common cut-set circuit chords cut-set windows Definition element labeled elements in common elements of G end branch f-circuit matrix f-circuits based G be coded G contains G is non-separable G of nullity Given a graph graph G graph of nullity graph of Theorem IF(L impedance matrix incidence matrix independent circuits integers Kuratowski subgraphs Lemma Let G maximum sign-set necessary and sufficient non-separable graph non-star cut-set nullity n number of elements number of vertices one-port planar graph planar or non-planar Proof Necessity Proof Sufficiency Property resistance matrix resistors self-loop sequences corresponding set of f-circuits sign matrix star cut-set star of G subset sufficient conditions symmetric matrix synthesis technique synthesis theorems TP'T tree of G vertex vg vertices of degree w-sequence windows of G