𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Wye-Delta and Delta-Wye Transformations: An Instructive Derivation

Book ID
114615676
Publisher
IEEE
Year
1982
Tongue
English
Weight
403 KB
Volume
25
Category
Article
ISSN
0018-9359

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Forbidden minors for wye-delta-wye reduc
Forbidden minors for wye-delta-wye reducibility
✍ Yaming Yu πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 57 KB

## Abstract A graph is __Y__ Δ __Y__ reducible if it can be reduced to a single vertex by a sequence of series‐parallel reductions and __Y__ Δ __Y__ transformations. The class of __Y__ Δ __Y__ reducible graphs is minor closed. We found a large number of minor minimal __Y__ Δ __Y__ irreducible graph

Four-terminal reducibility and projectiv
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
✍ Archdeacon, Dan; Colbourn, Charles J.; Gitler, Isidoro; Provan, J. Scott πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 188 KB

A graph is Y βˆ†Y -reducible if it can be reduced to a vertex by a sequence of series-parallel reductions and Y βˆ†Y -transformations. Terminals are dis-

On terminal delta-wye reducibility of pl
On terminal delta-wye reducibility of planar graphs
✍ Isidoro Gitler; FeliΓΊ Sagols πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 614 KB

We prove terminal -Y reducibility of planar graphs with at most three terminals. The most important consequence of our proof is that this implicitly gives an efficient algorithm with time complexity O(|E (G)| 4 ) for reducibility of planar graphs G with at most three terminals. It also can be used f

On the delta-wye reduction for planar gr
On the delta-wye reduction for planar graphs
✍ K. Truemper πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 367 KB

We provide an elementary proof of an important theorem by G. V. Epifanov, according to which every two-terminal planar graph satisfying certain connectivity restrictions can by some sequence of series/parallel reductions and delta-wye exchanges be reduced to the graph consisting of the two terminals