YΔ- and ΔY-transformation
In graph theory, ΔY- and YΔ-transformations (also written delta-wye and wye-delta) are a pair of operations on graphs. A ΔY-transformation replaces a triangle by a vertex of degree three; and conversely, a YΔ-transformation replaces a vertex of degree three by a triangle. The names for the operations derive from the shapes of the involved subgraphs, which look respectively like the letter Y and the Greek capital letter Δ.
A YΔ-transformation might create parallel edges, even if applied to a simple graph. For this reason ΔY- and YΔ-transformations are most naturally considered as operations on multigraphs. On multigraphs both operations preserve the edge count and are exact inverses of each other. In the context of simple graphs it is common to combine a YΔ-transformation with a subsequent normalization step that reduces parallel edges to a single edge. This might no longer preserve the number of edges, nor be exactly reversible via a ΔY-transformation.
Formal definition
Let [math]\displaystyle{ G }[/math] be a graph (potentially a multigraph).
If the edges [math]\displaystyle{ e_{12},e_{23},e_{31} }[/math] form a triangle [math]\displaystyle{ \Delta }[/math] with vertices [math]\displaystyle{ x_1,x_2,x_3 }[/math], then a ΔY-transformation of [math]\displaystyle{ G }[/math] at [math]\displaystyle{ \Delta }[/math] removes [math]\displaystyle{ e_{12},e_{23},e_{31} }[/math] and adds a new vertex [math]\displaystyle{ y }[/math] adjacent to all of [math]\displaystyle{ x_1,x_2,x_3 }[/math].
If [math]\displaystyle{ y }[/math] is a vertex of degree three with neighbors [math]\displaystyle{ x_1,x_2,x_3 }[/math], then a YΔ-transformation of [math]\displaystyle{ G }[/math] at [math]\displaystyle{ y }[/math] deletes [math]\displaystyle{ y }[/math] and adds three new edges [math]\displaystyle{ e_{12},e_{23},e_{31} }[/math] so that [math]\displaystyle{ e_{ij} }[/math] connects [math]\displaystyle{ x_i }[/math] and [math]\displaystyle{ x_j }[/math]. If the resulting graph is supposed to be a simple graph, then any resulting parallel edges are to be replaced by a single edge.
Relevance
ΔY- and YΔ-transformations are a tool both in pure graph theory as well as applications.
Both operations preserve a number of natural topological properties of graphs, such as being planar[1] or linkless.[2] This fact is used to compactly describe the forbidden minors of the associated graph classes as ΔY-families generated from a small number of graphs (see the section on ΔY-families below).
A particularly relevant application exists in electrical engineering in the study of three-phase power systems (see Y-Δ transform (electrical engineering)).[3] In this context they are also known as star-triangle transformations and are a special case of star-mesh transformations.
ΔY-families
The ΔY-family generated by a graph [math]\displaystyle{ G }[/math] is the smallest family of graphs that contains [math]\displaystyle{ G }[/math] and is closed under YΔ- and ΔY-transformations. Equivalently, it is constructed from [math]\displaystyle{ G }[/math] by recursively applying these transformations until no new graph is generated. If [math]\displaystyle{ G }[/math] is a finite graph it generates a finite ΔY-family, all members of which have the same edge count.
The ΔY-family generated by several graphs is the smallest family that contains all these graphs and is closed under YΔ- and ΔY-transformation.
Some notable families are generated in this way:
- the Petersen family is generated from the complete graph [math]\displaystyle{ K_6 }[/math]. It consists of the six forbidden minors for the class of linkless graphs.[2]
- the Heawood family is generated from [math]\displaystyle{ K_7 }[/math] and [math]\displaystyle{ K_{3,3,1,1} }[/math]. It consists of the 78 conjectured forbidden minors for the class of 4-flat graphs.[4]
YΔY-reducible graphs
A graph is YΔY-reducible if it can be reduced to a single vertex by a sequence of ΔY- or YΔ-transformations and the following normalization steps:
- removing a loop,
- removing a parallel edge,
- removing a vertex of degree one,
- smoothing out a vertex of degree two, i.e., replacing it by a single edge between its two former neighbors.
The YΔY-reducible graphs form a minor closed family and therefore have a forbidden minor characterization (by the Robertson-Seymour theorem). The graphs of the Petersen family constitute some (but not all) of the excluded minors.[5] In fact, already more than 68 billion excluded minor are known.[6]
The class of YΔY-reducible graphs lies between the classes of planar graphs and linkless graphs: each planar graph is YΔY-reducible, while each YΔY-reducible graph is linkless. Both inclusions are strict: [math]\displaystyle{ K_5 }[/math] is not planar but YΔY-reducible, while the graph in the figure is not YΔY-reducible but linkless.[5]
References
- ↑ Truemper, K. (1989). On the delta‐wye reduction for planar graphs. Journal of graph theory, 13(2), 141-148.
- ↑ 2.0 2.1 "Linkless embeddings of graphs in 3-space", Bulletin of the American Mathematical Society 28 (1): 84–89, 1993, doi:10.1090/S0273-0979-1993-00335-5.
- ↑ Johnson, D. E., Hilburn, J. L., Johnson, J. R., & Scott, P. D. (1986). Basic electric circuit analysis. Englewood Cliffs: Prentice-Hall.
- ↑ van der Holst, H. (2006). Graphs and obstructions in four dimensions. Journal of Combinatorial Theory, Series B, 96(3), 388-404.
- ↑ 5.0 5.1 Truemper, Klaus (1992), Matroid Decomposition, Academic Press, pp. 100–101, http://www.utdallas.edu/~klaus/Mbook/matroiddecompositionbook.pdf
- ↑ Yu, Y. (2006). More forbidden minors for Wye-Delta-Wye reducibility. the electronic journal of combinatorics, R7-R7.
 |  |
