Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Pivots, Determinants, and Perf...

Pivots, Determinants, and Perfect Matchings of Graphs

Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom, Pivots, Determinants, and Perfect Matchings of Graphs. Theoretical Computer Science 454, 64–71, 2012.

http://dx.doi.org/10.1016/j.tcs.2012.02.031

Abstract:

We consider sequences of local and edge complementations on graphs with loops (we allow local complementation only on looped vertices). We recall that these operations together form the matrix operation of principal pivot transform (or pivot) restricted to graphs. This fact is not well known, and as a consequence various special cases of the properties of pivot have been rediscovered multiple times. In this paper we give a gentle overview of various properties of pivot for local and edge complementations on graphs. Moreover, we relate the pivot operation to perfect matchings to obtain a purely graph-theoretical characterization of the effect of sequences of pivot operations. Finally, we show that two of the three operations that make up a formal graph model of the biological process of gene assembly in ciliates together form the matrix operation of Schur complement restricted to graphs.

BibTeX entry:

@ARTICLE{jBrHaHo12a,
  title = {Pivots, Determinants, and Perfect Matchings of Graphs},
  author = {Brijder, Robert and Harju, Tero and Hoogeboom, Hendrik Jan},
  journal = {Theoretical Computer Science},
  volume = {454},
  publisher = {Elsevier},
  pages = {64–71},
  year = {2012},
  keywords = {Principal pivot transform; Perfect matchings; Gene assembly in ciliates; Local complementation; Circle graph},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication