Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...