The group structure of pivot and loop complementation on graphs and set systems
From MaRDI portal
Abstract: We study the interplay between principal pivot transform (pivot) and loop complementation for graphs. This is done by generalizing loop complementation (in addition to pivot) to set systems. We show that the operations together, when restricted to single vertices, form the permutation group S_3. This leads, e.g., to a normal form for sequences of pivots and loop complementation on graphs. The results have consequences for the operations of local complementation and edge complementation on simple graphs: an alternative proof of a classic result involving local and edge complementation is obtained, and the effect of sequences of local complementations on simple graphs is characterized.
Recommendations
Cites work
- A generalization of Tutte's characterization of totally unimodular matrices
- Color-reversal by local complementation
- Computation in living cells. Gene assembly in ciliates
- Determinantal ideals, Pfaffian ideals, and the principal minor theorem
- Graphic presentations of isotropic systems
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3156382 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 1445310 (Why is no real title available?)
- scientific article; zbMATH DE number 3432469 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- Interlace polynomials
- Maximal pivots on graphs with an application to gene assembly
- Multimatroids. III: Tightness and fundamental graphs
- Pivot and loop complementation on graphs and set systems
- Pivots, determinants, and perfect matchings of graphs
- Principal pivot transforms: Properties and applications
- Rank-width and vertex-minors
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- The interlace polynomial of a graph
Cited in
(23)- Sorting by reversals and the theory of 4-regular graphs
- Hopf algebras and Tutte polynomials
- The excluded 3-minors for vf-safe delta-matroids
- A 2-isomorphism theorem for delta-matroids
- Eulerian and bipartite binary delta-matroids
- Matroids, delta-matroids and embedded graphs
- Inductive tools for connected delta-matroids and multimatroids
- The nullity theorem for principal pivot transform
- Symmetry constraints on temporal order in measurement-based quantum computation
- Pivot and loop complementation on graphs and set systems
- The adjacency matroid of a graph
- Interlace polynomials for multimatroids and delta-matroids
- Binary matroids and local complementation
- Partial-twuality polynomials of delta-matroids
- On the linear algebra of local complementation
- Orienting transversals and transition polynomials of multimatroids
- A primer on delta-matroids and multimatroids
- An activities expansion of the transition polynomial of a multimatroid
- Pivots, determinants, and perfect matchings of graphs
- Isotropic matroids. II: Circle graphs
- Improved upper bounds on color reversal by local inversions
- Tight upper bounds on color reversal by local inversions
- Recombination faults in gene assembly in ciliates modeled using multimatroids
This page was built for publication: The group structure of pivot and loop complementation on graphs and set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648991)
