## Abstract Let __G__ and __H__ be 2βconnected 2βisomorphic graphs with __n__ nodes. Whitney's 2βisomorphism theorem states that __G__ may be transformed to a graph __G__\* isomorphic to __H__ by repeated application of a simple operation, which we will term βswitchingβ. We present a proof of Whitn
Tellegen's theorem for 2-isomorphic networks
β Scribed by Cel, J.
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 51 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0098-9886
No coin nor oath required. For personal study only.
β¦ Synopsis
Let N and N I be directed networks having the same number of branches labelled correspondingly. It is proved that one of them can be reorientated so that u2 i "i2u for all vectors of corresponding branch voltages u, u and currents i, i satisfying Kirchhoff 's voltage and current law in every loop and cutset of N and N I if and only if under imposed correspondence of branches the networks are 2-isomoprhic. This is an 'if and only if' version of the converse of Tellegen's famous theorem established recently by the author and shows that Tellegen's theorem can in general be formulated for 2-isomorphic networks.
π SIMILAR VOLUMES
One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising wh
## Abstract Β© 2004 Wiley Periodicals, Inc. Microwave Opt Technol Lett 42: 345β346, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.20299