Pivots, Determinants, and Perfect Matchings of Graphs

Details Pivots, Determinants, and Perfect Matchings of Graphs Pivots, Determinants, and Perfect Matchings of Graphs

2008-11-21

arxiv.org/abs/0811.3500v1

Mathematics

Combinatorics

16 pages

Scientific paper

We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the same set S of vertices (modulo two). Moreover, given a set of vertices S, we characterize whether or not such a sequence using precisely the vertices of S exists. We also relate pivots to perfect matchings to obtain a graph-theoretical characterization. Finally, we consider graphs with self-loops to carry over the results to sequences containing both pivots and local complementation operations.

Affiliated with

Also associated with

No associations

Rating

Pivots, Determinants, and Perfect Matchings of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pivots, Determinants, and Perfect Matchings of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pivots, Determinants, and Perfect Matchings of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163158