View source for Circuit topology (electrical)

{{Short description|Form taken by the network of interconnections of a circuit}}
The '''circuit topology''' of an [[electronic circuit]] is the form taken by the [[Network analysis (electrical circuits)|network]] of interconnections of the circuit components.  Different specific values or ratings of the components are regarded as being the same topology.  Topology is not concerned with the physical layout of components in a circuit, nor with their positions on a [[circuit diagram]]; similarly to the [[Topology|mathematical concept of topology]], it is only concerned with what connections exist between the components.  There may be numerous physical layouts and circuit diagrams that all amount to the same topology.

Strictly speaking, replacing a component with one of an entirely different type is still the same topology.  In some contexts, however, these can loosely be described as different topologies.  For instance, interchanging inductors and capacitors in a [[low-pass]] [[Electronic filter|filter]] results in a [[high-pass]] filter.  These might be described as high-pass and low-pass topologies even though the network topology is identical.  A more correct term for these classes of object (that is, a network where the type of component is specified but not the absolute value) is [[Prototype filter|prototype network]].

Electronic network topology is related to [[topology|mathematical topology]]. In particular, for networks which contain only two-terminal devices, circuit topology can be viewed as an application of [[graph theory]].  In a [[Network analysis (electrical circuits)|network analysis]] of such a circuit from a topological point of view, the network [[node (circuits)|nodes]] are the [[vertex (graph theory)|vertices]] of graph theory, and the network branches are the [[edge (graph theory)|edges]] of graph theory.

Standard graph theory can be extended to deal with active components and multi-terminal devices such as [[integrated circuits]].  Graphs can also be used in the analysis of [[infinite networks]].

==Circuit diagrams==
The [[circuit diagram]]s in this article follow the usual conventions in electronics;<ref>Tooley, pp. 258–264</ref> lines represent [[Electrical conductor|conductors]], filled small circles represent junctions of conductors, and open small circles represent terminals for connection to the outside world.  In most cases, impedances are represented by rectangles.  A practical circuit diagram would use the specific symbols for [[resistor]]s, [[inductor]]s, [[capacitor]]s etc., but topology is not concerned with the type of component in the network, so the symbol for a general [[electrical impedance|impedance]] has been used instead.

The [[#Graph theory|Graph theory]] section of this article gives an alternative method of representing networks.

==Topology names==
Many topology names relate to their appearance when drawn diagrammatically.  Most circuits can be drawn in a variety of ways and consequently have a variety of names.  For instance, the three circuits shown in Figure 1.1 all look different but have identical topologies.<ref>Guillemin, pp.5–6</ref>
[[File:Tee topology.svg|thumb|650px|center|'''Figure 1.1'''.  T,Y and Star topologies are all identical.]]
This example also demonstrates a common convention of naming topologies after a letter of the alphabet to which they have a resemblance.  Greek alphabet letters can also be used in this way, for example Π ([[Pi (letter)|pi]]) topology and Δ ([[Delta (letter)|delta]]) topology.

==Series and parallel topologies==
For a network with two branches, there are only two possible topologies: [[Series and parallel circuits|series and parallel]].
[[File:Two branch topology.svg|thumb|500px|center|'''Figure 1.2'''.  Series and parallel topologies with two branches]]
Even for these simplest of topologies, there are variations in the way the circuit can be presented.
[[File:Series topology equivalents.svg|thumb|700px|center|'''Figure 1.3'''.  All these topologies are identical.  Series topology is a general name.  [[Voltage divider]] or potential divider is used for circuits of that purpose.  L-section is a common name for the topology in filter design.]]

For a network with three branches, there are four possible topologies.
[[File:Three branch topology.svg|thumb|650px|center|'''Figure 1.4'''.  Series and parallel topologies with three branches]]
Note that the parallel-series topology is another representation of the Delta topology discussed later.

Series and parallel topologies can continue to be constructed with greater and greater numbers of branches ''ad infinitum''.  The number of unique topologies that can be obtained from <math>n \in \N</math> series or parallel branches is 1, 2, 4, 10, 24, 66, 180, 522, 1532, 4624, <math>\dots</math> {{OEIS|A000084}}.<ref>{{cite journal |last=MacMahon |first=P.A. |date=17 October 1994 |orig-date=8 April 1892 |title=The combination of resistances |url=https://dx.doi.org/10.1016/0166-218X%2894%2990024-8 |journal=Discrete Applied Mathematics |volume=54 |issue=2–3 |pages=225–228 |doi=10.1016/0166-218X(94)90024-8 |access-date=22 July 2023}}</ref><ref>{{cite journal |last1=Riordan |first1=John |last2=Shannon |first2=C.E. |date=April 1942 |title=The Number of Two-terminal Series-parallel Networks |url=https://oeis.org/A000084/a000084_1.pdf |journal=Journal of Mathematics and Physics |volume=21 |issue=1–4 |pages=83–93 |doi=10.1002/sapm194221183 |access-date=22 July 2023}}</ref>

==Y and Δ topologies==
[[File:Y and delta topologies.svg|thumb|375px|center|'''Figure 1.5'''.  Y and Δ topologies]]
Y and Δ are important topologies in linear network analysis due to these being the simplest possible three-terminal networks. A [[Y-Δ transform]] is available for linear circuits.  This transform is important because there are some networks that cannot be analysed in terms of series and parallel combinations. These networks arise often in 3-phase power circuits as they are the two most common topologies for 3-phase motor or transformer windings. [[File:Y in delta network.svg|220px|thumb|left|'''Figure 1.6''']]An example of this is the network of figure 1.6, consisting of a Y network connected in parallel with a Δ network.  Say it is desired to calculate the impedance between two nodes of the network.  In many networks this can be done by successive applications of the rules for combination of series or parallel impedances.  This is not, however, possible in this case where the Y-Δ transform is needed in addition to the series and parallel rules.<ref>Farago, pp.18–21<br/>Redifon, p.22</ref>

The Y topology is also called star topology.  However, star topology may also refer to the more general case of many branches connected to the same node rather than just three.<ref>Redifon, p.22</ref> {{see also|Star-mesh transform}}
{{clear}}

==Simple filter topologies==
{{main|Electronic filter topology}}
[[File:Filter topologies.svg|425px|thumb|left|'''Figure 1.7'''.  Common [[Balanced circuit|balanced and unbalanced]] filter topologies]]
The topologies shown in figure 1.7 are commonly used for [[Electronic filter|filter]] and [[Attenuator (electronics)|attenuator]] designs.  The L-section is identical topology to the potential divider topology.  The T-section is identical topology to the Y topology.  The Π-section is identical topology to the Δ topology.

All these topologies can be viewed as a short section of a [[ladder topology]].  Longer sections would normally be described as ladder topology.  These kinds of circuits are commonly analysed and characterised in terms of a [[two-port network]].<ref>Farago, pp.112–116<br/>Redifon, pp.45–48</ref>
{{clear}}

==Bridge topology==
{{Main|Bridge circuit}}
[[File:Depictions of bridge topology.svg|750px|thumb|center|'''Figure 1.8''']]
Bridge topology is an important topology with many uses in both linear and non-linear applications, including, amongst many others, the [[bridge rectifier]], the [[Wheatstone bridge]] and the [[lattice phase equaliser]].  There are several ways that bridge topology is rendered in circuit diagrams.  The first rendering in figure 1.8 is the traditional depiction of a bridge circuit.  The second rendering clearly shows the equivalence between the bridge topology and a topology derived by series and parallel combinations.  The third rendering is more commonly known as lattice topology.  It is not so obvious that this is topologically equivalent.  It can be seen that this is indeed so by visualising the top left node moved to the right of the top right node.

[[File:Bridge topology with output load.svg|thumb|200px|left|'''Figure 1.9'''.  Bridge circuit with bridging output load shown]]
It is normal to call a network bridge topology only if it is being used as a [[two-port network]] with the input and output [[Port (circuit theory)|ports]] each consisting of a pair of diagonally opposite nodes.  The box topology in figure 1.7 can be seen to be identical to bridge topology but in the case of the filter the input and output ports are each a pair of ''adjacent'' nodes.  Sometimes the loading (or null indication) component on the output port of the bridge will be included in the bridge topology as shown in figure 1.9.<ref>Farago, pp.117–118</ref>
{{clear}}

==Bridged T and twin-T topologies==
[[File:Bridge T topology.svg|275px|thumb|right|'''Figure 1.10'''.  Bridged T topology]]
Bridged T topology is derived from bridge topology in a way explained in the [[Zobel network]] article.  There are many derivative topologies also discussed in the same article.
[[File:Twin-T topology.svg|370px|thumb|left|'''Figure 1.11''']]
There is also a twin-T topology which has practical applications where it is desirable to have the input and output share a common ([[Ground (electricity)|ground]]) terminal.  This may be, for instance, because the input and output connections are made with [[co-axial cable|co-axial topology]].  Connecting together an input and output terminal is not allowable with normal bridge topology and for this reason Twin-T is used where a bridge would otherwise be used for balance or null measurement applications.  The topology is also used in the [[twin-T oscillator]] as a sine wave generator.  The lower part of figure 1.11 shows twin-T topology redrawn to emphasise the connection with bridge topology.<ref>Farago, pp. 125–127</ref>
{{clear}}

==Infinite topologies==
[[File:Ladder topology.svg|525px|center|'''Figure 1.12''']]
[[Ladder topology]] can be extended without limit and is much used in filter designs.  There are many variations on ladder topology, some of which are discussed in the [[Electronic filter topology]] and [[Composite image filter]] articles.
[[File:Anti-ladder topology.svg|thumb|526px|center|'''Figure 1.13'''.  Anti-ladder topology]]
The balanced form of ladder topology can be viewed as being the [[Graph (discrete mathematics)|graph]] of the side of a [[Prism (geometry)|prism]] of arbitrary order.  The side of an [[antiprism]] forms a topology which, in this sense, is an anti-ladder.  Anti-ladder topology finds an application in [[voltage multiplier]] circuits, in particular the [[Cockcroft-Walton generator]].  There is also a full-wave version of the Cockcroft-Walton generator which uses a double anti-ladder topology.<ref>Campbell, pp.5–6, Kind and Fesser, pp.29–30</ref>

Infinite topologies can also be formed by cascading multiple sections of some other simple topology, such as lattice or bridge-T sections.  Such infinite chains of lattice sections occur in the theoretical analysis and artificial simulation of [[transmission lines]], but are rarely used as a practical circuit implementation.<ref>Campbell, pp.5–6, 20</ref>

==Components with more than two terminals==
Circuits containing components with three or more terminals greatly increase the number of possible topologies.  Conversely, the number of different circuits represented by a topology diminishes and in many cases the circuit is easily recognisable from the topology even when specific components are not identified.
{|
|[[File:Basic amplifier topology.svg|thumb|left|300px|'''Figure 1.14'''.  Basic [[amplifier]] topology such as [[common emitter]] [[bipolar junction transistor]] amplifier]]||[[File:Balanced amplifier topology.svg|thumb|left|300px|'''Figure 1.15'''.  Balanced amplifier such as a [[long-tailed pair]] amplifier]]
|}
With more complex circuits the description may proceed by specification of a [[transfer function]] between the [[two-port network|ports]] of the network rather than the topology of the components.<ref>Farago, pp.&nbsp;98–134</ref>

==Graph theory==
[[Graph theory]] is the branch of mathematics dealing with [[Graph (discrete mathematics)|graphs]].  In network analysis, graphs are used extensively to represent a network being analysed.  The graph of a network captures only certain aspects of a network; those aspects related to its connectivity, or, in other words, its topology.  This can be a useful representation and generalisation of a network because many network equations are [[Invariant (mathematics)|invariant]] across networks with the same topology.  This includes equations derived from [[Kirchhoff's circuit laws|Kirchhoff's laws]] and [[Tellegen's theorem]].<ref>Suresh, pp.483–484, 530–532</ref>

===History===
Graph theory has been used in the network analysis of linear, passive networks almost from the moment that Kirchhoff's laws were formulated.  [[Gustav Kirchhoff]] himself, in 1847, used graphs as an abstract representation of a network in his loop analysis of resistive circuits.<ref>Kirchhoff, G. (1847) [https://books.google.com/books?id=gx4AAAAAMAAJ&pg=PA497 "Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird"] (On the solution of the equations to which one is led during the investigation of the linear distribution of galvanic currents), ''Annalen der Physik und Chemie'', '''72''' (12) :  497–508.</ref>  This approach was later generalised to RLC circuits, replacing resistances with impedances.  In 1873 [[James Clerk Maxwell]] provided the dual of this analysis with node analysis.<ref>James Clerk Maxwell, ''A Treatise on Electricity and Magnetism'' (Oxford, England:  Clarendon Press, 1873), vol. 1, Part II, "On linear systems of conductors in general", [https://books.google.com/books?id=92QSAAAAIAAJ&pg=PA333 pp. 333–336.]</ref><ref>Wataru Mayeda and Sundaram Seshu (November 1957) "Topological Formulas for Network Functions," University of Illinois Engineering Experiment Station Bulletin, no. 446, p. 5.</ref>  Maxwell is also responsible for the topological theorem that the determinant of the node-admittance matrix is equal to the sum of all the tree admittance products.  In 1900 [[Henri Poincaré]] introduced the idea of representing a graph by its [[incidence matrix]],<ref>H. Poincaré (1900) "Second complément à l'Analysis Situs", ''Proceedings of the London Mathematical Society'', '''32''' :  277–308.  Available on-line at:  [http://www.mocavo.com/Proceedings-of-the-London-Mathematical-Society-Volume-32/854784/286#286 Mocavo.com] {{Webarchive|url=https://web.archive.org/web/20141101150814/http://www.mocavo.com/Proceedings-of-the-London-Mathematical-Society-Volume-32/854784/286#286 |date=2014-11-01 }}</ref> hence founding the field of [[algebraic topology]].  In 1916 [[Oswald Veblen]] applied the algebraic topology of Poincaré to Kirchhoff's analysis.<ref>Oswald Veblen, ''The Cambridge Colloquium 1916'', (New York : American Mathematical Society, 1918-1922), vol 5, pt. 2 :  Analysis Situs, [https://books.google.com/books?id=TV1MAQAAIAAJ&pg=RA1-PA25 "Matrices of orientation", pp. 25-27.]</ref>  Veblen is also responsible for the introduction of the [[spanning tree]] to aid choosing a compatible set of network variables.<ref name="Cederbaum, p.64">Cederbaum, p.64</ref>
[[File:Cauer lowpass.svg|thumb|350px|'''Figure 2.1.''' Circuit diagram of a ladder network low-pass filter: a two-element-kind network]]
Comprehensive cataloguing of network graphs as they apply to electrical circuits began with [[Percy MacMahon]] in 1891 (with an engineer friendly article in ''[[The Electrician]]'' in 1892) who limited his survey to series and parallel combinations.  MacMahon called these graphs yoke-chains.<ref group=note>'''Yoke-chains'''.  A terminology coined by [[Arthur Cayley]].  Yokes are branches in parallel, chains are branches in series.(MacMahon, 1891, p.330)  A single branch can be considered either a yoke or a chain.</ref>  [[Ronald M. Foster]] in 1932 categorised graphs by their [[nullity (graph theory)|nullity]] or [[rank (graph theory)|rank]] and provided charts of all those with a small number of nodes.  This work grew out of an earlier survey by Foster while collaborating with [[George Ashley Campbell|George Campbell]] in 1920 on 4-port telephone repeaters and produced 83,539 distinct graphs.<ref>Foster, p.309<br/>Foster and Campbell, p.232</ref>

For a long time topology in electrical circuit theory remained concerned only with linear passive networks.  The more recent developments of semiconductor devices and circuits have required new tools in topology to deal with them.  Enormous increases in circuit complexity have led to the use of [[combinatorics]] in graph theory to improve the efficiency of computer calculation.<ref name="Cederbaum, p.64"/>

===Graphs and circuit diagrams===
[[File:Ladder graph.svg|thumb|'''Figure 2.2'''. Graph of the ladder network shown in figure 2.1 with a four rung ladder assumed.]]
Networks are commonly classified by the kind of [[electrical element]]s making them up. In a circuit diagram these element-kinds are specifically drawn, each with its own unique symbol.  Resistive networks are one-element-kind networks, consisting only of ''R'' elements.  Likewise capacitive or inductive networks are one-element-kind.  The ''[[RC circuit|RC]]'', ''[[RL circuit|RL]]'' and [[LC circuit|''LC'' circuits]] are simple two-element-kind networks.  The [[RLC circuit|''RLC'' circuit]] is the simplest three-element-kind network.  The ''LC'' ladder network commonly used for [[low-pass filter]]s can have many elements but is another example of a two-element-kind network.<ref>Guillemin, p.5</ref>

Conversely, topology is concerned only with the geometric relationship between the elements of a network, not with the kind of elements themselves.  The heart of a topological representation of a network is the [[Graph (discrete mathematics)|graph]] of the network.  Elements are represented as the edges of the graph.  An edge is drawn as a line, terminating on dots or small circles from which other edges (elements) may emanate.  In circuit analysis, the edges of the graph are called ''branches''.  The dots are called the [[vertex (graph theory)|vertices]] of the graph and represent the [[node (circuits)|nodes]] of the network.  ''Node'' and ''vertex'' are terms that can be used interchangeably when discussing graphs of networks.  Figure 2.2 shows a graph representation of the circuit in figure 2.1.<ref>Guillemin, pp.5–6<br/>Suresh, p.485</ref>

Graphs used in network analysis are usually, in addition, both [[directed graph]]s, to capture the direction of current flow and voltage, and [[labelled graph]]s, to capture the uniqueness of the branches and nodes.  For instance, a graph consisting of a square of branches would still be the same topological graph if two branches were interchanged unless the branches were uniquely labelled.  In directed graphs, the two nodes that a branch connects to are designated the source and target nodes.  Typically, these will be indicated by an arrow drawn on the branch.<ref>Guillemin, p.5<br/>Minas, pp.213–214<br/>Suresh, p.485</ref>

===Incidence===
{{main|incidence matrix}}
Incidence is one of the basic properties of a graph.  An edge that is connected to a vertex is said to be ''incident'' on that vertex.  The incidence of a graph can be captured in matrix format with a matrix called an incidence matrix.  In fact, the incidence matrix is an alternative mathematical representation of the graph which dispenses with the need for any kind of drawing.  Matrix rows correspond to nodes and matrix columns correspond to branches.  The elements of the matrix are either zero, for no incidence, or one, for incidence between the node and branch.  Direction in directed graphs is indicated by the sign of the element.<ref name="Cederbaum, p.64"/><ref>Suresh, pp.485, 487–489</ref>

===Equivalence===
Graphs are equivalent if one can be transformed into the other by deformation.  Deformation can include the operations of [[translation (geometry)|translation]], [[Rotation (mathematics)|rotation]] and [[Reflection (mathematics)|reflection]]; bending and stretching the branches; and crossing or knotting the branches.  Two graphs which are equivalent through deformation are said to be ''congruent''.<ref>Foster, p.310</ref>

In the field of electrical networks, there are two additional transforms that are considered to result in equivalent graphs which do not produce congruent graphs.  The first of these is the interchange of series connected branches.  This is the dual of interchange of parallel connected branches which can be achieved by deformation without the need for a special rule.  The second is concerned with graphs divided into two or more ''separate parts'', that is, a graph with two sets of nodes which have no branches incident to a node in each set.  Two such separate parts are considered an equivalent graph to one where the parts are joined by combining a node from each into a single node.  Likewise, a graph that can be split into two separate parts by splitting a node in two is also considered equivalent.<ref>Guillemin, p.6-7<br/>Foster, p.310</ref>

===Trees and links===
[[File:Tree of graph.svg|thumb|'''Figure 2.3'''. One possible tree of the graph in figure 2.2. Links are shown as dotted lines.]]
A [[tree (graph theory)|tree]] is a graph in which all the nodes are connected, either directly or indirectly, by branches, but without forming any closed loops.  Since there are no closed loops, there are no currents in a tree.  In network analysis, we are interested in [[spanning tree]]s, that is, trees that connect every node present in the graph of the network.  In this article, spanning tree is meant by an unqualified ''tree'' unless otherwise stated.  A given network graph can contain a number of different trees.  The branches removed from a graph in order to form a tree are called [[link (geometry)|link]]s, the branches remaining in the tree are called ''twigs''.  For a graph with ''n'' nodes, the number of branches in each tree, ''t'', must be;

:<math>t = n - 1 \ </math>

An important relationship for circuit analysis is;

:<math>b = \ell + t \ </math>

where ''b'' is the number of branches in the graph and ''ℓ'' is the number of links removed to form the tree.<ref>Guillemin, p. 7<br/>Suresh, p. 486</ref>

===Tie sets and cut sets===
The goal of circuit analysis is to determine all the branch currents and voltages in the network.  These network variables are not all independent.  The branch voltages are related to the branch currents by the [[transfer function]] of the elements of which they are composed.  A complete solution of the network can therefore be either in terms of branch currents or branch voltages only.  Nor are all the branch currents independent from each other.  The minimum number of branch currents required for a complete solution is ''l''.  This is a consequence of the fact that a tree has ''l'' links removed and there can be no currents in a tree.  Since the remaining branches of the tree have zero current they cannot be independent of the link currents.  The branch currents chosen as a set of independent variables must be a set associated with the links of a tree: one cannot choose any ''l'' branches arbitrarily.<ref>Guillemin, pp.8–9</ref>

In terms of branch voltages, a complete solution of the network can be obtained with ''t'' branch voltages.  This is a consequence the fact that short-circuiting all the branches of a tree results in the voltage being zero everywhere.  The link voltages cannot, therefore, be independent of the tree branch voltages.<ref>Guillemin, pp.9–10</ref>
[[File:Graph cut set.svg|thumb|'''Figure 2.4'''. A cut set of the graph in figure 2.2 derived from the tree of figure 2.3 by cutting branch 3.]]
A common analysis approach is to solve for [[loop current]]s rather than branch currents.  The branch currents are then found in terms of the loop currents.  Again, the set of loop currents cannot be chosen arbitrarily.  To guarantee a set of independent variables the loop currents must be those associated with a certain set of loops.  This set of loops consists of those loops formed by replacing a single link of a given tree of the graph of the circuit to be analysed.  Since replacing a single link in a tree forms exactly one unique loop, the number of loop currents so defined is equal to ''l''.  The term ''loop'' in this context is not the same as the usual meaning of [[loop (graph theory)|loop]] in graph theory.  The set of branches forming a given loop is called a '''tie set'''.<ref group=note>'''Tie set.'''  The term ''tie set'' was coined by [[Ernst Guillemin]] (Guillemin, p.xv).  Guillemin says the name was chosen because if the branches of the tie set were reduced to zero length the graph would become "tied off" as a fishnet with a drawstring (Guillemin, p.17).<br/>Guillemin was a leading figure in the development and teaching of linear network analysis (Wildes and Lindgren, pp.154–159).</ref>  The set of network equations are formed by equating the loop currents to the algebraic sum of the tie set branch currents.<ref>Guillemin, pp.10–17</ref>

It is possible to choose a set of independent loop currents without reference to the trees and tie sets.  A sufficient, but not necessary, condition for choosing a set of independent loops is to ensure that each chosen loop includes at least one branch that was not previously included by loops already chosen.  A particularly straightforward choice is that used in [[mesh analysis]] in which the loops are all chosen to be meshes.<ref group=note>'''Mesh.'''  A mesh is a loop which does not enclose any other loops.</ref>  Mesh analysis can only be applied if it is possible to map the graph on to a plane or a sphere without any of the branches crossing over.  Such graphs are called [[planar graph]]s.  Ability to map onto a plane or a sphere are equivalent conditions.  Any finite graph mapped onto a plane can be shrunk until it will map onto a small region of a sphere.  Conversely, a mesh of any graph mapped onto a sphere can be stretched until the space inside it occupies nearly all of the sphere.  The entire graph then occupies only a small region of the sphere.  This is the same as the first case, hence the graph will also map onto a plane.<ref>Guillemin, pp.23–27<br/>Suresh p.514</ref>

There is an approach to choosing network variables with voltages which is analogous and [[Duality (electrical circuits)|dual]] to the loop current method.  Here the voltage associated with pairs of nodes are the primary variables and the branch voltages are found in terms of them.  In this method also, a particular tree of the graph must be chosen in order to ensure that all the variables are independent.  The dual of the tie set is the [[cut set]].  A tie set is formed by allowing all but one of the graph links to be open circuit.  A cut set is formed by allowing all but one of the tree branches to be short circuit.  The cut set consists of the tree branch which was not short-circuited and any of the links which are not short-circuited by the other tree branches.  A cut set of a graph produces two disjoint [[Glossary of graph theory#Subgraphs|subgraphs]], that is, it cuts the graph into two parts, and is the minimum set of branches needed to do so.  The set of network equations are formed by equating the node pair voltages to the algebraic sum of the cut set branch voltages.<ref>Guillemin, pp.17–23</ref>  The dual of the special case of mesh analysis is [[nodal analysis]].<ref>Guillemin, p.43<br/>Suresh, p.518, pp.523–528</ref>

===Nullity and rank===
The nullity, ''N'', of a graph with ''s'' separate parts and ''b'' branches is defined by;

:<math>N = b - n + s \ </math>

The nullity of a graph represents the number of degrees of freedom of its set of network equations.  For a planar graph, the nullity is equal to the number of meshes in the graph.<ref>Foster, pp.310–311</ref>

The rank, ''R'' of a graph is defined by;

:<math>R = n - s \ </math>

Rank plays the same role in nodal analysis as nullity plays in mesh analysis.  That is, it gives the number of node voltage equations required.  Rank and nullity are dual concepts and are related by;<ref>Foster, pp.312–313</ref>

:<math>R + N = b \ </math>

===Solving the network variables===
Once a set of geometrically independent variables have been chosen the state of the network is expressed in terms of these.  The result is a set of independent linear equations which need to be [[simultaneous equation|solved simultaneously]] in order to find the values of the network variables.  This set of equations can be expressed in a matrix format which leads to a characteristic parameter matrix for the network.  Parameter matrices take the form of an [[impedance matrix]] if the equations have been formed on a loop-analysis basis, or as an [[admittance matrix]] if the equations have been formed on a node-analysis basis.<ref>Guillemin, pp.64–81</ref>

These equations can be solved in a number of well-known ways.  One method is the [[Gaussian elimination|systematic elimination of variables]].<ref>Guillemin, pp.112–116</ref>  Another method involves the use of [[determinant]]s.  This is known as [[Cramer's rule]] and provides a direct expression for the unknown variable in terms of determinants.  This is useful in that it provides a compact expression for the solution.  However, for anything more than the most trivial networks, a greater calculation effort is required for this method when working manually.<ref>Guillemin, pp.116–120</ref>

===Duality===
Two graphs are dual when the relationship between branches and node pairs in one is the same as the relationship between branches and loops in the other.  The dual of a graph can be found entirely by a [[Dual impedance#Graphical method|graphical method]].<ref>Guillemin, p.44<br/>Suresh, pp.516–517</ref>

The dual of a graph is another graph.  For a given tree in a graph, the complementary set of branches (i.e., the branches not in the tree) form a tree in the dual graph.  The set of current loop equations associated with the tie sets of the original graph and tree are identical to the set of voltage node-pair equations associated with the cut sets of the dual graph.<ref>Guillemin, pp.49–50<br/>Suresh, p.517</ref>

The following table lists dual concepts in topology related to circuit theory.<ref>Guillemin, pp.43–44<br/>Foster, p.313</ref>
[[File:Graph dual.svg|thumb|'''Figure 2.5'''. The dual graph of the graph in figure 2.2.]]
{|class="wikitable" style="width:25em;"
|+'''Summary of dual concepts'''
|-
|Current||Voltage
|-
|Tree||Maze
|-
|Branch||Branch
|-
|Mesh||Node
|-
|Loop||Node pair
|-
|Link||Tree branch
|-
|Tie set||Cut set
|-
|Short circuit||Open circuit
|-
|Parallel connection||Series connection
|-
|Nullity||Rank
|}

The dual of a tree is sometimes called a '''maze'''<ref group=note>'''Maze.''' This term is another coining by Guillemin (Guillemin, p.xv).  So named because the spaces in a graph traversed by passing through the links has the form of a puzzle maze.</ref>  It consists of spaces connected by links in the same way that the tree consists of nodes connected by tree branches.<ref>Guillemin, pp.51–53</ref>

Duals cannot be formed for every graph.  Duality requires that every tie set has a dual cut set in the dual graph.  This condition is met if and only if the graph is mappable on to a sphere with no branches crossing.  To see this, note that a tie set is required to "tie off" a graph into two portions and its dual, the cut set, is required to cut a graph into two portions.  The graph of a finite network which will not map on to a sphere will require an [[Torus#n-fold torus|''n''-fold torus]].  A tie set that passes through a hole in a torus will fail to tie the graph into two parts.  Consequently, the dual graph will not be cut into two parts and will not contain the required cut set.  Consequently, only planar graphs have duals.<ref>Guillemin, p.535<br/>Suresh, p.517</ref>

Duals also cannot be formed for networks containing [[mutual inductance]]s since there is no corresponding capacitive element.  Equivalent circuits can be developed which do have duals, but the dual cannot be formed of a mutual inductance directly.<ref>Guillemin, p.536</ref>

===Node and mesh elimination===
Operations on a set of network equations have a topological meaning which can aid visualisation of what is happening.  [[System of linear equations#Elimination of variables|Elimination]] of a node voltage from a set of network equations corresponds topologically to the elimination of that node from the graph.  For a node connected to three other nodes, this corresponds to the well known [[Y-Δ transform]].  The transform can be extended to greater numbers of connected nodes and is then known as the [[star-mesh transform]].<ref name="Guillemin, pp.127–132">Guillemin, pp. 127–132</ref>

The inverse of this transform is the Δ-Y transform which analytically corresponds to the elimination of a mesh current and topologically corresponds to the elimination of a mesh.  However, elimination of a mesh current whose mesh has branches in common with an arbitrary number of other meshes will not, in general, result in a realisable graph.  This is because the graph of the transform of the general star is a graph which will not map on to a sphere (it contains [[star polygon]]s and hence multiple crossovers).  The dual of such a graph cannot exist, but is the graph required to represent a generalised mesh elimination.<ref name="Guillemin, pp.127–132"/>

===Mutual coupling===
[[File:Graph double tuned.svg|thumb|'''Figure 2.6'''. A [[double-tuned amplifier|double-tuned]] circuit frequently used to couple stages of tuned amplifiers. '''A''', the graph of the double-tuned circuit. '''B''', an equivalent graph with the disjoint parts combined.]]
In conventional graph representation of circuits, there is no means of explicitly representing mutual inductive couplings, such as occurs in a [[transformer]], and such components may result in a [[connectivity (graph theory)|disconnected graph]] with more than one separate part.  For convenience of analysis, a graph with multiple parts can be combined into a single graph by unifying one node in each part into a single node.  This makes no difference to the theoretical behaviour of the circuit so analysis carried out on it is still valid.  It would, however, make a practical difference if a circuit were to be implemented this way in that it would destroy the isolation between the parts.  An example would be a transformer earthed on both the primary and secondary side.  The transformer still functions as a transformer with the same voltage ratio but can now no longer be used as an [[isolation transformer]].<ref>Guillemin, pp.6–7</ref>

More recent techniques in graph theory are able to deal with active components, which are also problematic in conventional theory.  These new techniques are also able to deal with mutual couplings.<ref name="Cederbaum, p.65">Cederbaum, p.65</ref>

===Active components===
There are two basic approaches available for dealing with mutual couplings and active components.  In the first of these, [[Samuel Jefferson Mason]] in 1953 introduced [[signal-flow graph]]s.<ref>Samuel J. Mason (September 1953) "Feedback theory — Some properties of signal flow graphs," ''Proceedings of the I.R.E.'', '''41''' (9) :  1144–1156.</ref>  Signal-flow graphs are weighted, directed graphs.  He used these to analyse circuits containing mutual couplings and active networks.  The weight of a directed edge in these graphs represents a gain, such as possessed by an amplifier.  In general, signal-flow graphs, unlike the regular directed graphs described above, do not correspond to the topology of the physical arrangement of components.<ref name="Cederbaum, p.65"/>

The second approach is to extend the classical method so that it includes mutual couplings and active components.  Several methods have been proposed for achieving this.  In one of these, two graphs are constructed, one representing the currents in the circuit and the other representing the voltages.  Passive components will have identical branches in both trees but active components may not.  The method relies on identifying spanning trees that are common to both graphs.  An alternative method of extending the classical approach which requires only one graph was proposed by Chen in 1965.<ref group=note>Chen, Wai-Kai., [http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=1082619 "Topological analysis for active networks"], ''IEEE Transactions on Circuit Theory'', vol.13, iss.4, pp.438–439, December 1966.</ref>  Chen's method is based on a [[rooted tree]].<ref name="Cederbaum, p.65"/>

====Hypergraphs====
Another way of extending classical graph theory for active components is through the use of [[hypergraph]]s.  Some electronic components are not represented naturally using graphs.  The [[transistor]] has three connection points, but a normal graph branch may only connect to two nodes.  Modern [[integrated circuit]]s have many more connections than this.  This problem can be overcome by using hypergraphs instead of regular graphs.<ref>Minas, p.213</ref>
[[File:Hypergraph example.svg|thumb|left|'''Figure 2.7'''. An example of a hypergraph. Regular edges are shown in black, hyperedges are shown in blue, and tentacles are shown in red.]]
In a conventional representation components are represented by edges, each of which connects to two nodes.  In a hypergraph, components are represented by [[hyperedge]]s which can connect to an arbitrary number of nodes.  Hyperedges have ''tentacles'' which connect the hyperedge to the nodes.  The graphical representation of a hyperedge may be a box (compared to the edge which is a line) and the representations of its tentacles are lines from the box to the connected nodes.  In a directed hypergraph, the tentacles carry labels which are determined by the hyperedge's label.  A conventional directed graph can be thought of as a hypergraph with hyperedges each of which has two tentacles.  These two tentacles are labelled ''source'' and ''target'' and usually indicated by an arrow.  In a general hypergraph with more tentacles, more complex labelling will be required.<ref>Minas, pp.213–214</ref>

Hypergraphs can be characterised by their incidence matrices.  A regular graph containing only two-terminal components will have exactly two non-zero entries in each row.  Any incidence matrix with more than two non-zero entries in any row is a representation of a hypergraph.  The number of non-zero entries in a row is the ''rank'' of the corresponding branch, and the highest branch rank is the rank of the incidence matrix.<ref>Skiena, p.382</ref>
{{clear}}

===Non-homogeneous variables===
Classical network analysis develops a set of network equations whose network variables are homogeneous in either current (loop analysis) or voltage (node analysis).  The set of network variables so found is not necessarily the minimum necessary to form a set of independent equations.  There may be a difference between the number of variables in a loop analysis to a node analysis.  In some cases the minimum number possible may be less than either of these if the requirement for homogeneity is relaxed and a mix of current and voltage variables allowed.  A result from Kishi and Katajini in 1967<ref group=note>A summary of this work was first presented at;
*Kishi, Genya; Kajitani, Yoji, "On maximally distinct trees", ''Fifth Annual Allerton Conference on Circuit and System Theory'', pp.635–643, 1967.

See the [[#Bibliography|Bibliography]] section for the full paper published later in 1969.</ref> is that the absolute minimum number of variables required to describe the behaviour of the network is given by the maximum distance<ref group=note>'''Distance''' between trees is defined as the number of edges that are in one tree but not in the other.  That is, it is the number of edges which must be changed in order to transform one tree into the other (Kishi and Kajitani, p.323).</ref> between any two spanning [[forest (graph theory)|forest]]s<ref group=note>'''Spanning forest'''.  A forest of trees in which every node of the graph is visited by one of the trees.</ref> of the network graph.<ref name="Cederbaum, p.65"/>

===Network synthesis===
Graph theory can be applied to [[network synthesis]].  Classical network synthesis realises the required network in one of a number of [[canonical form]]s.  Examples of canonical forms are the realisation of a [[driving-point impedance]] by Cauer's canonical ladder network or Foster's canonical form or Brune's realisation of an [[immittance]] from his [[positive-real function]]s.  Topological methods, on the other hand, do not start from a given canonical form.  Rather, the form is a result of the mathematical representation.  Some canonical forms require mutual inductances for their realisation.  A major aim of topological methods of network synthesis has been to eliminate the need for these mutual inductances.  One theorem to come out of topology is that a realisation of a driving-point impedance without mutual couplings is minimal if and only if there are no all-inductor or all-capacitor loops.<ref>Cederbaum, p.67</ref> 

Graph theory is at its most powerful in network synthesis when the elements of the network can be represented by real numbers (one-element-kind networks such as resistive networks) or binary states (such as switching networks).<ref name="Cederbaum, p.65"/>

===Infinite networks===
Perhaps, the earliest network with an infinite graph to be studied was the ladder network used to represent [[transmission line]]s developed, in its final form, by [[Oliver Heaviside]] in 1881.  Certainly all early studies of infinite networks were limited to periodic structures such as ladders or grids with the same elements repeated over and over.  It was not until the late 20th century that tools for analysing infinite networks with an arbitrary topology became available.<ref>Brittain, p.39<br/>Zemanian, p.vii</ref>

Infinite networks are largely of only theoretical interest and are the plaything of mathematicians.  Infinite networks that are not constrained by real-world restrictions can have some very unphysical properties.  For instance Kirchhoff's laws can fail in some cases and infinite resistor ladders can be defined which have a driving-point impedance which depends on the termination at infinity.  Another unphysical property of theoretical infinite networks is that, in general, they will dissipate infinite power unless constraints are placed on them in addition to the usual network laws such as Ohm's and Kirchhoff's laws.  There are, however, some real-world applications.  The transmission line example is one of a class of practical problems that can be modelled by infinitesimal elements (the [[distributed-element model]]).  Other examples are launching waves into a continuous medium, [[fringing field]] problems, and [[Electrode array|measurement of resistance between points of a substrate]] or down a borehole.<ref>Zemanian, pp.vii-ix, 17–18, 24–26</ref>

Transfinite networks extend the idea of infinite networks even further.  A node at an extremity of an infinite network can have another branch connected to it leading to another network.  This new network can itself be infinite.  Thus, topologies can be constructed which have pairs of nodes with no finite [[Path (graph theory)|path]] between them.  Such networks of infinite networks are called transfinite networks.<ref>Zemanian, p.x</ref>

==Notes==
{{reflist|group=note|35em}}

==See also ==
* [[Symbolic circuit analysis]]
* [[Network topology]]　　　　　　                               
* [[Topological quantum computer|Topological quantum computer]]

==References==
{{reflist|22em}}

==Bibliography==
*Brittain, James E., The introduction of the loading coil: George A. Campbell and Michael I. Pupin", ''Technology and Culture'', '''vol. 11''', no. 1, pp.&nbsp;36–57, The Johns Hopkins University Press, January 1970 {{doi|10.2307/3102809}}.
*Campbell, G. A., [https://archive.org/stream/bellsystemtechni01amerrich#page/n155/mode/2up "Physical theory of the electric wave-filter"], ''Bell System Technical Journal'', November 1922, vol. 1, no. 2, pp.&nbsp;1–32.
*Cederbaum, I., [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1085419 "Some applications of graph theory to network analysis and synthesis"], ''IEEE Transactions on Circuits and Systems'', '''vol.31''', iss.1, pp.&nbsp;64–68, January 1984.
*Farago, P. S., ''An Introduction to Linear Network Analysis'', The English Universities Press Ltd, 1961.
*Foster, Ronald M., [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5056068 "Geometrical circuits of electrical networks"], ''Transactions of the American Institute of Electrical Engineers'', '''vol.51''', iss.2, pp.&nbsp;309–317, June 1932.
*Foster, Ronald M.; Campbell, George A., [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4764962 "Maximum output networks for telephone substation and repeater circuits"], ''Transactions of the American Institute of Electrical Engineers'', '''vol.39''', iss.1, pp.&nbsp;230–290, January 1920.
*Guillemin, Ernst A., ''Introductory Circuit Theory'', New York: John Wiley & Sons, 1953 {{OCLC|535111}}
*Kind, Dieter; Feser, Kurt, ''High-voltage Test Techniques'', translator Y. Narayana Rao, Newnes, 2001 {{ISBN|0-7506-5183-0}}.
*Kishi, Genya; Kajitani, Yoji, [http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1082966 "Maximally distant trees and principal partition of a linear graph"], ''IEEE Transactions on Circuit Theory'', '''vol.16''', iss.3, pp.&nbsp;323–330, August 1969.
*MacMahon, Percy A., "Yoke-chains and multipartite compositions in connexion with the analytical forms called “Trees”", ''Proceedings of the London Mathematical Society'', '''vol.22''' (1891), pp.330–346 {{doi|10.1112/plms/s1-22.1.330}}.
*MacMahon, Percy A., [https://books.google.com/books?id=wIdDAQAAMAAJ&pg=PA601 "Combinations of resistances"], ''The Electrician'', '''vol.28''', pp.&nbsp;601–602, 8 April 1892.<br/>Reprinted in ''Discrete Applied Mathematics'', '''vol.54''', iss.Iss.2–3, pp.&nbsp;225–228, 17 October 1994 {{doi|10.1016/0166-218X(94)90024-8}}.
*Minas, M., "Creating semantic representations of diagrams", ''Applications of Graph Transformations with Industrial Relevance: international workshop, AGTIVE'99, Kerkrade, The Netherlands, September 1–3, 1999: proceedings'', pp.&nbsp;209–224, Springer, 2000 {{ISBN|3-540-67658-9}}.
*''Redifon Radio Diary, 1970'', William Collins Sons & Co, 1969.
*Skiena, Steven S., ''The Algorithm Design Manual'', Springer, 2008, {{ISBN|1-84800-069-3}}.
*Suresh, Kumar K. S., "Introduction to network topology" chapter 11 in ''Electric Circuits And Networks'', Pearson Education India, 2010 {{ISBN|81-317-5511-8}}.
*Tooley, Mike, ''BTEC First Engineering: Mandatory and Selected Optional Units for BTEC Firsts in Engineering'', Routledge, 2010 {{ISBN|1-85617-685-1}}.
*Wildes, Karl L.; Lindgren, Nilo A., "Network analysis and synthesis: Ernst A. Guillemin", ''A Century of Electrical Engineering and Computer Science at MIT, 1882–1982'', pp.&nbsp;154–159, MIT Press, 1985 {{ISBN|0-262-23119-0}}.
*Zemanian, Armen H., ''Infinite Electrical Networks'', Cambridge University Press, 1991 {{ISBN|0-521-40153-4}}.

{{Good article}}

[[Category:Electrical engineering]]
[[Category:Electronic engineering]]