Voltage graph

In graph theory, a voltage graph is a directed graph whose edges are labelled invertibly by elements of a group. It is formally identical to a gain graph, but it is generally used in topological graph theory as a concise way to specify another graph called the derived graph of the voltage graph.

Typical choices of the groups used for voltage graphs include the two-element group ${\displaystyle \mathbb {Z} _{2}}$ (for defining the bipartite double cover of a graph), free groups (for defining the universal cover of a graph), d-dimensional integer lattices ${\displaystyle \mathbb {Z} ^{d}}$ (viewed as a group under vector addition, for defining periodic structures in d-dimensional Euclidean space), ^[1] and finite cyclic groups ${\displaystyle \mathbb {Z_{n}} }$ for n > 2. When Π is a cyclic group, the voltage graph may be called a cyclic-voltage graph.

Definition

Formal definition of a Π-voltage graph, for a given group Π:

• Begin with a digraph G. (The direction is solely for convenience in notation.)
• A Π-voltage on an arc of G is a label of the arc by an element ${\displaystyle x\in \Pi }$. For instance, in the case where ${\displaystyle \Pi =\mathbb {Z} _{n}}$, the label is a number i (mod n).
• A Π-voltage assignment is a function ${\displaystyle \alpha :E(G)\rightarrow \Pi }$ that labels each arc of G with a Π-voltage.
• A Π-voltage graph is a pair ${\displaystyle (G,\alpha :E(G)\rightarrow \Pi )}$ such that G is a digraph and α is a voltage assignment.
• The voltage group of a voltage graph ${\displaystyle (G,\alpha :E(G)\rightarrow \Pi )}$ is the group Π from which the voltages are assigned.

Note that the voltages of a voltage graph need not satisfy Kirchhoff's voltage law, that the sum of voltages around a closed path is 0 (the identity element of the group), although this law does hold for the derived graphs described below. Thus, the name may be somewhat misleading. It results from the origin of voltage graphs as dual to the current graphs of topological graph theory.

The derived graph

The derived graph of a voltage graph ${\displaystyle (G,\alpha :E(G)\rightarrow \mathbb {Z} _{n})}$ is the graph ${\displaystyle {\tilde {G}}}$ whose vertex set is ${\displaystyle {\tilde {V}}=V\times \mathbb {Z} _{n}}$ and whose edge set is ${\displaystyle {\tilde {E}}=E\times \mathbb {Z} _{n}}$, where the endpoints of an edge (e, k) such that e has tail v and head w are ${\displaystyle (v,\ k)}$ and ${\displaystyle (w,\ k+\alpha (e))}$.

Although voltage graphs are defined for digraphs, they may be extended to undirected graphs by replacing each undirected edge by a pair of oppositely ordered directed edges and by requiring that these edges have labels that are inverse to each other in the group structure. In this case, the derived graph will also have the property that its directed edges form pairs of oppositely oriented edges, so the derived graph may itself be interpreted as being an undirected graph.

The derived graph is a covering graph of the given voltage graph. If no edge label of the voltage graph is the identity element, then the group elements associated with the vertices of the derived graph provide a coloring of the derived graph with a number of colors equal to the group order. An important special case is the bipartite double cover, the derived graph of a voltage graph in which all edges are labeled with the non-identity element of a two-element group. Because the order of the group is two, the derived graph in this case is guaranteed to be bipartite.

Polynomial time algorithms are known for determining whether the derived graph of a ${\displaystyle \mathbb {Z} ^{d}}$-voltage graph contains any directed cycles. ^[1]

Examples

Any Cayley graph of a group Π, with a given set Γ of generators, may be defined as the derived graph for a Π-voltage graph having one vertex and Γ self-loops, each labeled with one of the generators in Γ. ^[2]

The Petersen graph is the derived graph for a ${\displaystyle \mathbb {Z} _{5}}$-voltage graph in the shape of a dumbbell with two vertices and three edges: one edge connecting the two vertices, and one self-loop on each vertex. One self-loop is labeled with 1, the other with 2, and the edge connecting the two vertices is labeled 0. More generally, the same construction allows any generalized Petersen graph GP(n,k) to be constructed as a derived graph of the same dumbbell graph with labels 1, 0, and k in the group ${\displaystyle \mathbb {Z} _{n}}$. ^[3]

The vertices and edges of any periodic tessellation of the plane may be formed as the derived graph of a finite graph, with voltages in ${\displaystyle \mathbb {Z} ^{2}}$.

Notes

1. Iwano & Steiglitz (1987); Kosaraju & Sullivan (1988); Cohen & Megiddo (1989).
2. Gross & Tucker (1987), Theorem 2.2.3, p. 69.
3. Gross & Tucker (1987), Example 2.1.2, p.58.

References

• Cohen, Edith; Megiddo, Nimrod (1989), "Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs", Proc. 21st Annual ACM Symposium on Theory of Computing (STOC '89), pp. 523–534, doi: 10.1145/73007.73057 , ISBN   0-89791-307-8 .
• Gross, Jonathan L. (1974), "Voltage graphs", Discrete Mathematics, 9 (3): 239–246, doi:10.1016/0012-365X(74)90006-5 .
• Gross, Jonathan L.; Tucker, Thomas W. (1977), "Generating all graph coverings by permutation voltage assignments", Discrete Mathematics, 18 (3): 273–283, doi: 10.1016/0012-365X(77)90131-5 .
• Gross, Jonathan L.; Tucker, Thomas W. (1987), Topological Graph Theory, New York: Wiley.
• Iwano, K.; Steiglitz, K. (1987), "Testing for cycles in infinite graphs with periodic structure", Proc. 19th Annual ACM Symposium on Theory of Computing (STOC '87), pp. 46–55, doi:10.1145/28395.28401, ISBN   0-89791-221-7, S2CID   37934099 .
• Kosaraju, S. Rao; Sullivan, Gregory (1988), "Detecting cycles in dynamic graphs in polynomial time", Proc. 20th Annual ACM Symposium on Theory of Computing (STOC '88), pp. 398–406, doi:10.1145/62212.62251, ISBN   0-89791-264-0, S2CID   14290312 .