Isomorphism for even cycle matroids - I

Details Isomorphism for even cycle matroids - I Isomorphism for even cycle matroids - I

2011-09-14

arxiv.org/abs/1109.2978v1

Mathematics

Combinatorics

Scientific paper

A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is a pair formed by a graph together with a special set of edges of the graph. Such a pair is called a signed graph. We consider the problem of determining the relation between two signed graphs representing the same even cycle matroid. We refer to this problem as the Isomorphism Problem for even cycle matroids. We present two classes of signed graphs and we solve the Isomorphism Problem for these two classes. We conjecture that, up to simple operations, any two signed graphs representing the same even cycle matroid are either in one of these classes, or related by a modification of an operation for graphic matroids, or belonging to a small set of examples.

Affiliated with

Also associated with

No associations

Rating

Isomorphism for even cycle matroids - I 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 Isomorphism for even cycle matroids - I, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isomorphism for even cycle matroids - I will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568616