Local complementation

Short description: Operation in graph theory

In graph theory, local complementation (also known as vertex inversion) is an operation on a graph that toggles adjacencies among the neighbours of a chosen vertex, while all other adjacencies remain unchanged. Despite its simple definition, it preserves interesting properties and generates a complex equivalence relation. The operation was introduced by Anton Kotzig and later studied in depth by André Bouchet and Von-Der-Flaass.

Formally, the local complementation of a simple undirected graph $G$ at a vertex $v$ is an operation that produces a new graph, denoted by $G\star v$. This operation is defined by replacing the subgraph of $G$ induced by $N_G(v)$ with its complementary subgraph. In other words, two distinct vertices $x$ and $y$ are adjacent in the graph $G\star v$ when exactly one of the following holds:

1. vertices $x$ and $y$ are adjacent in $G$; or
2. both vertices $x$ and $y$ are neighbours of $v$ in $G$.

Two graphs are said to be locally equivalent if one can be obtained from the other through a sequence of local complementations. This defines an equivalence relation on graphs, whose equivalence classes are known as local equivalence classes. For example, the star graph and complete graph on $n$ vertices are locally equivalent, and they form a local equivalence class. The local equivalence classes on graphs with up to 12 vertices has been computed. The size of a local equivalence class is at most $3^n$, and this collection of graphs can be enumerated efficiently.

Applications

Structural graph theory

The Robertson–Seymour theorem states that the graph minor relation is a well-quasi ordering. It was proved in a series of twenty papers spanning over 500 pages from 1983 to 2004. The algorithmic consequences are vast - together with an efficient algorithm for graph minor testing, the result provides efficient algorithms for solving a range of computational problems where the optimal value is monotonic in the graph minor relation.

Local complementations are central to the vertex-minor relation, which shares many similarities with the graph minor relation. Better understanding of the local complementation operation could extend the Robertson–Seymour theorem to prove that the vertex-minor relation is also a well-quasi ordering.

Measurement based quantum computing

For a given the graph state $|G⟩$, the action of the local Clifford operation is equivalent to the local complementation transformation on the graph $G$. The study of graph states that are locally equivalent is relevant to building quantum circuits in measurement based quantum computing (MBQC)

Similarly, local complementation is also related to state preparation in photonic quantum computing (PQC).

Properties

1. The local complement operation is self inverse; that is, $(G\star v)\star v=G$.
2. Local complementations commute only when vertices are non-adjacent; that is, $(G\star v)\star w=(G\star w)\star v$ unless $vw\in E(G)$.
3. Connected components are preserved by the local complementation operation, so it is common analyse each component of the graph independently. So without loss of generality, all graphs will be assumed to be connected.
4. All locally equivalent graphs can be reached after a sequence of at most $\max (n+1,10n/9)$ local complementations.
5. Locally equivalent trees are isomorphic (Mulder's conjecture), and there exists a simple expression to count such trees.
6. If a graph is locally equivalent to a tree, it has a subgraph isomorphic to that tree.
7. If a graph is locally equivalent to the cycle graph, it contains a Hamiltonian cycle.
8. If a graph is locally equivalent to its complement, it is self-complementary.
9. The number of essentially different ways of transforming one graph into another via local complementation is $0,3,6$ or $2^k$ for some $k\ge 0$.
10. Any class of locally equivalent distance-hereditary graphs is equal to the class of the circle graphs of the Euler tours of some 4-regular graph.
11. Locally equivalent graphs have the same rank-width.
12. Counting locally equivalent graphs is #P-complete.
13. Determining the minimum degree that can be reached by means of local complementation is NP-complete and APX-hard, and can be computed by an ${{𝒪}}^{*}(1.938^n)$ algorithm.
14. Determining the minimum total edge weight by means of local complementation is NP-complete.
15. Determining the minimum number of edges by means of local complementation is likely NP-complete.

Pivot operation

Local complementations do not commute for adjacent vertices, motivating the following operation that performs complementations at adjacent vertices.

For adjacent vertices $x$ and $y$, the pivot operation (also historically known as an edge complementation) is defined as$$G\wedge xy=G\star x\star y\star x.$$It can be shown that $G\star x\star y\star x=G\star y\star x\star y$, and hence the pivot operation is well defined. Alternatively, the graph $G\wedge xy$ can be obtained from $G$ by toggling adjacencies between every pair of vertices in two different sets among $N_G(x)-(N_G(y)\cup y)$, $N_G(x)\cap N_G(y)$ and $N_G(y)-(N_G(x)\cup x)$ then switching the labels $x$ and $y$. The pivot operation satisfies the identities $G\wedge xy\wedge xy=G$ and $G\wedge xy\wedge yz=G\wedge xz$.

Two graphs are said to be pivot equivalent if one can be obtained from the other through a sequence of pivot operations. Since pivot operations consist of local complementation operations, pivot equivalent graphs are locally equivalent. The converse is true for bipartite graphs, but is not generally true. If $G$ and $H$ are pivot equivalent graphs, there are pairwise disjoint edges $e_1,e_2,\dots ,e_k$ such that $G\wedge e_1\wedge e_2\dots \wedge e_k=H$. Fon-Der-Flass proved that if graphs $G$ and $H$ are locally equivalent, they are pivot equivalent to some $G^{\prime }$ and $H^{\prime }$ respectively such that $G^{\prime }*v_1{v}_2\dots v_k=H^{\prime }$ and $\{v_1,v_2,\dots ,v_k\}$ is an independent set in $G^{\prime }$ and $H^{\prime }$.

The size of a pivot equivalence class is at most $2^n$, and this collection of graphs can be enumerated efficiently.

Pivot equivalence has been studied using even binary delta-matroids.

Invariants

Cut-rank function

As a graph undergoes local complementation, its adjacency matrix changes in a well defined way. In particular, the entries that change are exactly some sub-matrix (excluding the main diagonal). Hence, it may be natural to study the local complementation operation using linear algebra.

For a graph $G$ with vertex set $V$, the cut-rank function (also historically known as the connectivity function) is denoted ${\rho }_G:{𝒫}(V)\to \mathbb{\mathbb{N}}$. It is defined over the vertex subsets $X\subseteq V$ such that ${\rho }_G(X)$ is the rank of the bi-adjacency matrix of the partition $(X,V-X)$, defined over the finite field GF(2). That is, the rank of the $X\times (V-X)$ binary matrix $M$ where $M_{uv}=1$ when $uv$ is an edge in $G$. Intuitively, ${\rho }_G(X)$ is a measure of how complex the connectivity is between $X$ and the remaining vertices.

Since the rank of a matrix is preserved by elementary row and column operations, a straightforward argument shows that locally equivalent graphs have identical cut-rank functions. However, the converse is not true - a counterexample can be constructed using labelled Petersen graphs. It is known that bipartite graphs with identical cut-rank functions are pivot-equivalent, and so locally equivalent bipartite graphs are also pivot-equivalent.

The cut-rank function is submodular since it can be shown that ${\rho }_G(X)+{\rho }_G(Y)\ge {\rho }_G(X\cup Y)+{\rho }_G(X\cap Y)$ for any vertex set $X$ and $Y$. However, it is not monotone.

Local sets

The cut-rank can be considered 'most interesting' when it is either rank 1 or full rank. Since the cut-rank is invariant over local complementation, so are the sets with a particular cut-rank. The sets of rank 1 are studied using canonical split decompositions in a later section. Here, we define a local set as a vertex set which does not have full cut-rank.

Define $${\mathrm{O}\mathrm{d}\mathrm{d}}_G(X)=\{v\in V(G)\mid |N(v)\cap X|=1mod2\}.$$A set of vertices $S$ is local in $G$ if $S=X\cup {\mathrm{O}\mathrm{d}\mathrm{d}}_G(X)$ for some subset $X\subseteq V(G)$. Now if $S$ is local in $G$, it is also local in any graph locally equivalent to $G$. Local sets can equivalently be defined as the sets of vertices which do not have full cut-rank (i.e. the sets $S$ where ${\rho }_G(S)<|S|$). Intuitively, a local set is some linear combination of the closed neighbourhoods of $G$. Local sets are used to study the degrees of vertices in $G$.

This invariant may be a helpful tool to quickly show that graphs are not locally equivalent. However, there are graphs with the same local sets which are not locally equivalent, since there are graphs with identical cut-rank functions which are not locally equivalent.

Totally isotropic subspaces

The richest description of a class of locally equivalent graphs is an extension of the local sets idea, involving a linear algebra structure over the Klein four-group. Each locally equivalent graph, equipped with two specific vectors, corresponds to some graphic presentations of the same totally isotropic subspace.

Let $K_4$ be the Klein four-group. A vector $\mathbf{𝐚}\in K_4^n$ is said to be complete if ${\mathbf{𝐚}}_i$ is nonzero for every $1\le i\le n$. Two vectors $\mathbf{𝐚},\mathbf{𝐛}\in K_4^n$ are said to be supplementary if ${\mathbf{𝐚}}_i$ and ${\mathbf{𝐛}}_i$ are nonzero and distinct for every $1\le i\le n$. For a set $S$, define $\mathbf{𝐚}[S]$ as the vector where $\mathbf{𝐚}[S{]}_i=a_i$ if $i\in S$, and $\mathbf{𝐚}[S{]}_i=0$ otherwise.

A subspace $L$ of $K_4^n$ is called a totally isotropic subspace if $\dim (L)=\dim (K_4^n)/2=n$, and every two complete vectors in $L$ are not supplementary.

A graphic presentation of a totally isotropic subspace $L$ is a triple $(G,\mathbf{𝐚},\mathbf{𝐛})$ where $G$ is a simple graph on the vertex set $V=\{1,\dots ,n\}$ and $\mathbf{𝐚}$ and $\mathbf{𝐛}$ are supplementary vectors of $K_4^n$, such that $L$ is spanned by the set $$\{\mathbf{𝐚}[N(v)]+\mathbf{𝐛}[\{v\}]\mid v\in V\}.$$For a fixed $L$, there is a one-to-one correspondence between every graphic presentation $(G,\mathbf{𝐚},\mathbf{𝐛})$ and every complete vector $\mathbf{𝐚}$ where $\mathbf{𝐚}\in ̸L$, the vectors $\mathbf{𝐚}$ here are known are Eulerian vectors. Furthermore, if $(G,\mathbf{𝐚},\mathbf{𝐛})$ is a graphic presentation of $L$, so is $$(G\star v,\mathbf{𝐚}+\mathbf{𝐛}[\{v\}],\mathbf{𝐛}+\mathbf{𝐚}[N(v)])$$ and $$(G\wedge vw,\mathbf{𝐚}[V\setminus \{v,w\}]+\mathbf{𝐛}[\{v,w\}],\mathbf{𝐚}[\{v,w\}]+\mathbf{𝐛}[V\setminus \{v,w\}]).$$The fundamental graphs of $L$ form a local equivalence class. These facts leads to important results about determining local equivalence and locally equivalent class sizes, which is discussed in the next 2 sections.

This structure can be considered as an extension of the local sets structure, since $L=\{\mathbf{𝐚}[{\mathrm{O}\mathrm{d}\mathrm{d}}_G(X)]+\mathbf{𝐛}[X]\mid X\subseteq V\}$, and when $\mathbf{𝐚}=\mathbf{𝐛}$, $L=\{\mathbf{𝐚}[S]\mid S\text{ is local in }G\}$.

Characterisation of local equivalence

The following characterisations of locally equivalent graphs are straightforward results using totally isotropic subspaces. This leads to a efficient algorithm to recognise locally equivalent graphs.

Let $G_1$ and $G_2$ be simple graphs and fix supplementary vectors ${\mathbf{𝐚}}_1$ and ${\mathbf{𝐛}}_1$. he graphs $G_1$ and $G_2$ are locally equivalent if and only if there are supplementary vectors ${\mathbf{𝐚}}_2$ and ${\mathbf{𝐛}}_2$ such that $(G_1,{\mathbf{𝐚}}_1,{\mathbf{𝐛}}_1)$ and $(G_2,{\mathbf{𝐚}}_2,{\mathbf{𝐛}}_2)$ are graphic presentations of the same totally isotropic subspace. The existence of such vectors ${\mathbf{𝐚}}_2$ and ${\mathbf{𝐛}}_2$ can be determined in ${𝒪}(n^3)$ by solving a system of linear equations. A modification to this algorithm can, with the same time complexity, recover a sequence of at most $3n/2$ local complementations transforming $G_1$ into $G_2$.

An equivalent characterisation can be formulated using vertex sets. Let $N_1$ and $N_2$ denote the neighbourhood functions of $G_1$ and $G_2$ respectively. Then graphs $G_1$ and $G_2$ are locally equivalent if and only if there are vertex subsets $X,Y,Z,T$ such that for every pair of vertices $v,w$, $$|X\cap N_1(v)\cap N_2(w)|+|Y\cap N_1(v)\cap \{w\}|+|Z\cap N_2(w)\cap \{v\}|+|T\cap \{v,w\}|\equiv 0(\mathrm{mod}2),$$and the symmetric difference of $X\cap T$ with $Y\cap Z$ is the entire vertex set.

Global interlace polynomial

The global interlace polynomial (also known as the Tutte-Martin polynomial), is a polynomial that corresponds to a simple graph $G$. It is defined recursively as$$Q(G;x)=\{\begin{array}{ll}Q(G-u;x)+Q((G*u)-u;x)+Q((G\wedge uv)-u;x)& uv\in E(G)\\ x^n& G\text{ has no edges and }n\text{ vertices}\end{array}$$Now if $G$ and $H$ are locally equivalent, $Q(G,x)=Q(H,x)$ for any $x$. Additionally,

• $Q(G,2)$ is a multiple of the number of graphs locally equivalent to $G$. In particular, if $G$ is a fundamental graph of a totally isotropic subspace $L$, this gives the number of Eulerian vectors in $L$.
• $Q(G;4)/2^n$ is the number of induced Eulerian subgraphs in $G$. (An Eulerian graph contains only vertices of even degree).

The polynomial has closed-form formulas in certain cases:

• The path graphs $P_n$ have the closed form $Q(P_n;x)={\lambda }_1{(1+\sqrt{1+x})}^{n-1}+{\lambda }_2{(1-\sqrt{1+x})}^{n-1}$ where ${\lambda }_1=x/2+x/\sqrt{1+x}$ and ${\lambda }_2=x/2-x/\sqrt{1+x}$.
• More generally, a tree $T$ has the global interlace polynomial $Q(T;x)=\sum _{k\ge 0}{\mathrm{\Phi }}_k(T)2^{n-2k}{x}^k$, where ${\mathrm{\Phi }}_k(T)$ is the number of matchings of size $k$ in $T$.
• The cycle graphs $C_n$ have the closed form $Q(C_n;2)=(1+\sqrt{3}{)}^n+(1-\sqrt{3}{)}^n-4(2^{n-1}+(-1{)}^n)/3$.

An equivalent definition of the global interlace polynomial involves a summation over subsets of vertex sets. Let the graph $G$ have the adjacency matrix $A$ over the binary field. For a vertex set $S\in V(G)$, write $A[S]$ to denote the $S\times S$ sub-matrix of $A$. Let $I_X$ be the $V(G)\times V(G)$ diagonal matrix over the binary field such that the $(v,v)$-entry is 1 when $v\in X$, and 0 otherwise. The global interlace polynomial can equivalently be defined as$$Q(G;x)=\sum _{R\subseteq S\subseteq V(G)}(x-2{)}^{\mathrm{n}\mathrm{u}\mathrm{l}\mathrm{l}\mathrm{i}\mathrm{t}\mathrm{y}((A+I_R)[S])}.$$There are some interesting similarities to the canonical Tutte polynomial. In particular, the recurrence looks similar to the deletion-contraction formula, and both polynomials can be formulated as a sum of terms raised to the power of a matrix rank. Isomorphic graphs have the same Tutte polynomial, while locally equivalent or isomorphic graphs have the same global interlace polynomial.

Canonical split decomposition

A split of a graph $G$ is a partition of its vertex set $(X,Y)$ such that $|X|,|Y|\ge 2$ and ${\rho }_G(X)=1$. This happens exactly when the connectivity between $X$ and $Y$ is a complete bipartite graph, and complete bipartite graphs have a simple known structure over local complementation.

If a graph admits a split, it can be built by the 1-join of two graphs. The 1-join of two graphs $G_1$ and $G_2$ with marker vertices $v_1\in V(G_1)$ and $v_2\in V(G_2)$ is defined to be the graph obtained from the disjoint union of $G_1-v_1$ and $G_2-v_2$ by adding an edge between every neighbour of $v_1$ in $G_1$ and every neighbour of $v_2$ in $G_2$.

The canonical split decomposition can be constructed using the following procedure: Start from a set $\{G\}$ consisting of a single graph. Repeatedly pick a graph $H$ from this set that admits a split. Then replace $H$ with $2$ smaller graphs whose 1-join reconstructs $H$. This process is applied only when $H$ is neither a complete graph nor a star. The set now contains all induced prime subgraphs of $G$ along with some star graphs and cliques. Lastly, associate a tree by having one node for each graph in the resulting set and adding edges between corresponding marker vertices.

The canonical split decomposition is unique and has preserves important structural properties over local complementation.

1. The rank-width of $G$ is the maximum rank-width of all prime induced subgraphs.

Vertex-minor relation

Local complementation gives rise to several derived operations that play a central role in graph minor theory. A graph $H$ is a vertex-minor (also historically known as l-reduction or i-minor) of a graph $G$ if $H$ is an induced subgraph of a graph locally equivalent to $G$.

Deciding whether $H$ is a vertex-minor of $G$ for two input graphs $G$ and $H$ is NP-complete, even if $H$ is a complete graph and $G$ is a circle graph.. However, for each fixed circle graph $H$, there is an ${𝒪}(n^3)$-time algorithm to decide whether an input $n$-vertex graph $G$ contains a vertex-minor isomorphic to $H$. Every prime graph with at least 6 vertices has a prime vertex-minor with one less vertex.

Distance-hereditary graphs are exactly the graphs with no vertex-minor isomorphic to $C_5$, and exactly the graphs which are the vertex-minor of a tree.

Pivot-minor relation

A graph $H$ is a pivot-minor of a graph $G$ if $H$ is an induced subgraph of a graph pivot-equivalent to $G$. Bipartite graphs with the pivot-minor relation are essentially equivalent to binary matroids with the matroid minor relation.

Relation to circle graphs

For a circle graph $G$, performing a local complementation at $v$ corresponds to an graphical transformation of its chord diagram. In particular, the chord diagram of $G\star v$ is obtains from the chord diagram of $G$ by cutting the circumference by chord representing $v$, then reversing one arc. The class of circle graphs are hence closed under local complementation, and they are also closed under taking vertex-minors.