r-Local Complementation in Graph Optimization

• r-Local complementation is a graph transformation method that applies at most r local complementations to optimize a graph's minimum degree.
• It bridges combinatorial graph theory and quantum information by informing protocols in quantum routing and reducing measurement overhead.
• Extremal bounds and algorithmic strategies highlight its role in complexity theory and the efficient exploration of local complementations in graph states.

Searching arXiv for papers on local complementation, r-local minimum degree, and related graph-state/network results. arxiv_search query: "local complementation graph state vertex-minor local minimum degree arXiv" r-Local complementation denotes the study of graph transformations obtained by applying a bounded number $r$ of local complementations, together with the induced optimization and complexity questions that arise from this restriction. In the standard operation, for a graph $G=(V,E)$ and a vertex $u\in V$, local complementation replaces the induced subgraph on the neighborhood of $u$ by its complement. In the literature summarized here, this bounded-step perspective appears explicitly through the quantity $\delta_{\mathrm{loc}}^r(G)$, the minimum degree attainable after exactly $r$ local complementations (Cattanéo et al., 2015). By contrast, work on graph states and quantum routing uses only the ordinary one-vertex operation $\tau_a$ and does not introduce an “r-local complementation” generalization in that setting (Hahn et al., 2018). Related but distinct is edge local complementation, or pivot, which acts on an edge rather than a vertex and is used in Tanner-graph decoding while preserving the represented code (0905.4164).

1. Formal operation and bounded-step variants

Let $G=(V,E)$ be a simple undirected graph. For a vertex $u\in V(G)$, the local complementation of $G$ at $G=(V,E)$0, denoted $G=(V,E)$1 in (Cattanéo et al., 2015), is obtained by replacing the induced subgraph $G=(V,E)$2 by its complement. Equivalently, for all distinct $G=(V,E)$3,

$G=(V,E)$4

An equivalent Boolean form given in the same source is

$G=(V,E)$5

This is the standard vertex local complementation operation (Cattanéo et al., 2015).

In graph-state notation, the same transformation is written as $G=(V,E)$6 for a vertex $G=(V,E)$7, where all edges between neighbors of $G=(V,E)$8 are toggled and all other edges remain unchanged. If $G=(V,E)$9 is the adjacency matrix over $u\in V$0 and $u\in V$1 is the adjacency matrix of the complete graph on $u\in V$2, then

$u\in V$3

This formulation is used in quantum-network and graph-state analysis (Hahn et al., 2018).

The bounded-step generalization appears in the definition of the $u\in V$4-local minimum degree:

$u\in V$5

Its basic properties are explicit: $u\in V$6, the sequence $u\in V$7 is nonincreasing in $u\in V$8, and $u\in V$9 (Cattanéo et al., 2015). In this sense, r-local complementation is not a new elementary graph operation but a bounded-horizon regime for iterating the ordinary one.

A terminological distinction is necessary. In the quantum-network paper, “No r-local generalization in this paper” is stated explicitly; all constructions rely solely on $u$0, which flips edges inside the 1-hop neighborhood $u$1 (Hahn et al., 2018). Thus, “r-local complementation” in the bounded-step sense belongs to the optimization framework of local minimum degree rather than to the quantum-routing formalism of that paper.

2. Local minimum degree and equivalent characterizations

The central invariant associated with iterated local complementation is the local minimum degree

$u$2

This quantity asks how far the minimum degree can be reduced within the local-complementation orbit of a graph (Cattanéo et al., 2015).

A key characterization uses the odd neighborhood of a vertex set. For $u$3,

$u$4

that is, a vertex belongs to $u$5 iff it has an odd number of neighbors in $u$6. The paper states the equivalence

$u$7

where $u$8 is the rank over $u$9 of the adjacency submatrix between $\delta_{\mathrm{loc}}^r(G)$0 and $\delta_{\mathrm{loc}}^r(G)$1 (Cattanéo et al., 2015).

These equalities connect local complementation to two distinct combinatorial viewpoints. The first is parity-based, through odd neighborhoods. The second is rank-based, through cut-rank. This places local complementation in direct contact with isotropic systems, rank-width methods, and vertex-minor theory. A plausible implication is that bounded-step questions such as $\delta_{\mathrm{loc}}^r(G)$2 interpolate between purely local graph editing and full orbit optimization: the reachable set after $\delta_{\mathrm{loc}}^r(G)$3 steps is constrained, but the objective remains the same minimum-degree minimization.

The same parity-centric structure also underlies complexity reductions. In particular, the parameterized complexity results for LOCAL-MIN-DEGREE and BIP-LOCAL-MIN-DEGREE are formulated via the EVENSET problem, which asks for a nonempty set $\delta_{\mathrm{loc}}^r(G)$4 with $\delta_{\mathrm{loc}}^r(G)$5 and $\delta_{\mathrm{loc}}^r(G)$6 in a bipartite graph (Cattanéo et al., 2015). This linkage shows that parity constraints are not merely representational convenience; they are structurally decisive.

3. Extremal bounds for $\delta_{\mathrm{loc}}^r(G)$7 and heuristic bounds for $\delta_{\mathrm{loc}}^r(G)$8

The extremal theory in (Cattanéo et al., 2015) establishes both lower and upper bounds for the unconstrained local minimum degree. For every $\delta_{\mathrm{loc}}^r(G)$9, there exists an $r$0-vertex graph $r$1 with

$r$2

and there exists a bipartite $r$3-vertex graph with

$r$4

On the upper-bound side, for any graph of order $r$5,

$r$6

and for bipartite graphs,

$r$7

The same paper also proves

$r$8

where $r$9 is the vertex-cover number (Cattanéo et al., 2015).

These bounds delimit how much degree reduction local complementation can enforce in the worst case. They also underpin exact exponential algorithms, because the search for a minimizing set can be truncated to subsets below these upper bounds.

For the bounded-step quantity $\tau_a$0, (Cattanéo et al., 2015) gives a brute-force viewpoint and a heuristic combinatorial upper bound. By depth-$\tau_a$1 search, one can explore all sequences of $\tau_a$2 local complementations in $\tau_a$3 branches, pruning whenever the current minimum degree already exceeds the best value found. The paper then states, as a representative formula, that for every integer $\tau_a$4 and $\tau_a$5 sufficiently large, any $\tau_a$6 of order $\tau_a$7 satisfies

$\tau_a$8

This is presented as the outcome of iterating the proof strategy behind the general upper bound (Cattanéo et al., 2015).

The status of this formula is important. It is given as a heuristic consequence of iterating the underlying argument rather than as a separately isolated theorem in the paper. This suggests a bounded-step decay picture in which even a small number of local complementations can substantially lower the minimum degree. A plausible implication is that many practical instances may be effectively reducible without traversing the full local-complementation orbit.

4. Complexity landscape and exact algorithms

The decision problem LOCAL-MIN-DEGREE asks, given a graph $\tau_a$9 and integer $G=(V,E)$0, whether $G=(V,E)$1; BIP-LOCAL-MIN-DEGREE is the bipartite restriction. The complexity picture in (Cattanéo et al., 2015) is layered.

First, the paper states that the local minimum degree problem is NP-Complete and hard to approximate. Second, it proves that EVENSET is FPT-reducible to LOCAL-MIN-DEGREE and that BIP-LOCAL-MIN-DEGREE is FPT-reducible to EVENSET. The resulting corollary is that LOCAL-MIN-DEGREE and BIP-LOCAL-MIN-DEGREE are FPT-equivalent to EVENSET. Consequently, they lie in W[2], while W[1]-hardness remains open because EVENSET’s hardness is itself open (Cattanéo et al., 2015).

The exact-algorithm results are correspondingly exponential but nontrivial. For general graphs, $G=(V,E)$2 can be computed in time

$G=(V,E)$3

For bipartite graphs, the sharper structural bound yields

$G=(V,E)$4

These procedures enumerate subsets up to the proven size thresholds and test the cut-rank condition in polynomial time (Cattanéo et al., 2015).

For bounded $G=(V,E)$5, the paper provides a direct search procedure for $G=(V,E)$6 via depth-$G=(V,E)$7 exploration of sequences of local complementations. The stated implementation idea is elementary but useful: recursively apply local complementation at every vertex, maintain the best minimum degree encountered at depth $G=(V,E)$8, and prune whenever a branch cannot improve the current best (Cattanéo et al., 2015). Memoization of isomorphic states and pruning through global upper bounds are cited as natural refinements.

A separate but related complexity result arises in graph-state extraction. The problem “Given two labeled graphs $G=(V,E)$9, can $u\in V(G)$0 be obtained from $u\in V(G)$1 by a sequence of local complementations and single-qubit Pauli measurements?” is equivalent to the VERTEX-MINOR problem and is NP-complete (Hahn et al., 2018). However, the same source identifies tractable cases: any three-party GHZ state can be distilled in polynomial time; certain four-party GHZ states can be distilled under a repeater-line condition; and if the source graph has bounded rank-width, then for any fixed target graph $u\in V(G)$2 there is a polynomial-time algorithm deciding extractability and outputting the required sequence (Hahn et al., 2018). This places local complementation at a crossroads between difficult global orbit questions and restricted families admitting efficient algorithms.

5. Graph states, local Clifford implementation, and quantum routing

In graph-state quantum information, local complementation has an operational meaning at the level of state vectors. If $u\in V(G)$3 is the graph state associated with $u\in V(G)$4, then local complementation at a vertex $u\in V(G)$5 is implemented by a local Clifford unitary $u\in V(G)$6 such that

$u\in V(G)$7

with

$u\in V(G)$8

where $u\in V(G)$9 denotes $G$0 (Hahn et al., 2018).

This equivalence between a combinatorial graph rewrite and a simple local Clifford unitary is central to quantum-network routing. The paper “Quantum network routing and local complementation” uses sequences of local complementations together with single-qubit Pauli measurements to reduce measurement overhead relative to standard repeater-style approaches (Hahn et al., 2018). The key theorem states:

We can create an EPR pair between two nodes $G$1 and $G$2 of an arbitrary graph state using the $G$3-protocol with at most as many measurements as with the standard repeater protocol.

The corresponding lemma states that $G$4-measurements along a shortest path between two nodes are equivalent to performing a series of local complementations on that path, followed by $G$5-measurements on the intermediate nodes (Hahn et al., 2018). This identifies measurement-based routing primitives with local-complementation dynamics on the underlying graph.

The paper is explicit that it does not define an r-local extension: all constructions use only the standard 1-hop neighborhood operation $G$6 (Hahn et al., 2018). Nevertheless, the bounded-step viewpoint from (Cattanéo et al., 2015) provides a useful lens for interpreting such protocols. This suggests that some quantum-routing procedures can be regarded as carefully chosen short sequences in the local-complementation orbit, optimized not for minimum degree but for extractability of target entanglement resources.

6. Canonical examples and related operations

Two examples in (Hahn et al., 2018) illustrate how local complementation changes routing capabilities.

In the butterfly network, the target is to create EPR pairs on $G$7 and $G$8. Rather than building two separate repeater lines, the optimal protocol is:

1. Perform local complementations in order: LC$G$9, LC$G=(V,E)$00, LC$G=(V,E)$01.
2. Then $G=(V,E)$02-measure nodes $G=(V,E)$03 and $G=(V,E)$04.
3. The remaining graph is two disjoint edges $G=(V,E)$05 and $G=(V,E)$06.

The paper states that this uses only two single-qubit measurements and bypasses the central bottleneck (Hahn et al., 2018). It also proves two structural propositions: there is no 5-node graph state with a bottleneck for simultaneous communication between two pairs of nodes that can be solved using local Cliffords and a Pauli measurement of a single node; and there are only four 6-node graph states with such a bottleneck solvable by local Cliffords and Pauli measurements, all equivalent to the butterfly up to relabeling (Hahn et al., 2018).

In the $G=(V,E)$07 cluster example, the goal is an EPR pair between vertices $G=(V,E)$08 and $G=(V,E)$09. The shortest path is $G=(V,E)$10. The standard repeater approach requires isolating the path by $G=(V,E)$11-measuring all neighbors of the path, at least four nodes, followed by $G=(V,E)$12-measuring the three intermediate nodes $G=(V,E)$13, for a total of at least seven measurements. By contrast, the $G=(V,E)$14-protocol measures $G=(V,E)$15 in turn along the path and then $G=(V,E)$16-measures the new neighbors of $G=(V,E)$17 and $G=(V,E)$18, only three further nodes, for a total of six measurements. Moreover, one retains a residual 4-qubit cluster on $G=(V,E)$19 from which a second EPR can be extracted by a single measurement (Hahn et al., 2018).

A related but different operation is edge local complementation (ELC), also called pivot, as used in Tanner graphs (0905.4164). For an edge $G=(V,E)$20 in a bipartite Tanner graph, ELC toggles all edges between $G=(V,E)$21 and $G=(V,E)$22 and then swaps the adjacency lists of $G=(V,E)$23 and $G=(V,E)$24. This preserves the code because it corresponds over $G=(V,E)$25 to row additions and a column permutation of the parity-check matrix (0905.4164). Although vertex local complementation and edge local complementation are distinct operations, both are orbit-generating local graph transformations with strong algebraic invariance properties.

7. Applications, scope, and common sources of confusion

The main application domains represented in the cited works are quantum communication and coding theory. In quantum networking, local complementation is used to solve bottlenecked simultaneous communication problems and to reduce the number of required measurements for extracting entanglement resources (Hahn et al., 2018). In coding theory, edge local complementation is interleaved with sum-product decoding in the SPA-ELC algorithm, where random pivots generate structurally distinct Tanner graphs for the same code and improve performance relative to standard SPA in the reported small-blocklength experiments (0905.4164).

Several distinctions are essential for avoiding conceptual conflation.

Concept	Operation	Source
Local complementation	Complement induced subgraph on a vertex neighborhood	(Cattanéo et al., 2015, Hahn et al., 2018)
r-local complementation	Bounded number $G=(V,E)$26 of repeated local complementations, expressed through $G=(V,E)$27	(Cattanéo et al., 2015)
Edge local complementation	Pivot on an edge, toggle cross-neighborhood edges and swap adjacency lists	(0905.4164)

A common misunderstanding is to treat “r-local complementation” as a standard graph-state operation defined in quantum-network work. The available source material does not support that interpretation. The quantum-routing paper explicitly states that no r-local generalization is introduced there; only the ordinary $G=(V,E)$28 operation is used (Hahn et al., 2018). Conversely, the bounded-step notation $G=(V,E)$29 in (Cattanéo et al., 2015) is about optimization of reachable minimum degree, not about redefining the elementary move itself.

Another possible source of confusion is the relationship between local complementation and extractability questions. In graph states, local complementations combined with Pauli measurements characterize vertex-minor reachability, and the general problem is NP-complete (Hahn et al., 2018). In ordinary graph optimization, local complementation alone defines the orbit over which $G=(V,E)$30 and $G=(V,E)$31 are minimized (Cattanéo et al., 2015). These are adjacent but not identical problems.

Taken together, the cited works show that local complementation is simultaneously a graph-rewriting primitive, a local Clifford action on graph states, and the basis for nontrivial optimization and complexity theory. The bounded-step perspective encapsulated by $G=(V,E)$32 formalizes how much can be achieved with only a limited number of such moves (Cattanéo et al., 2015), while applications in quantum routing and code-preserving Tanner-graph transformations demonstrate that even short sequences of local operations can yield structurally and operationally significant effects (Hahn et al., 2018, 0905.4164).