The edge-flipping group of a graph

Details The edge-flipping group of a graph The edge-flipping group of a graph

2008-09-25

arxiv.org/abs/0809.4399v2

Mathematics

Combinatorics

19 pages

Scientific paper

Let $X=(V,E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X.$ A move applied to a configuration is to select a black edge $\epsilon\in E$ and change the colors of all adjacent edges of $\epsilon.$ Given an initial configuration and a final configuration, try to find a sequence of moves that transforms the initial configuration into the final configuration. This is the edge-flipping puzzle on $X,$ and it corresponds to a group action. This group is called the edge-flipping group $\mathbf{W}_E(X)$ of $X.$ This paper shows that if $X$ has at least three vertices, $\mathbf{W}_E(X)$ is isomorphic to a semidirect product of $(\mathbb{Z}/2\mathbb{Z})^k$ and the symmetric group $S_n$ of degree $n,$ where $k=(n-1)(m-n+1)$ if $n$ is odd, $k=(n-2)(m-n+1)$ if $n$ is even, and $\mathbb{Z}$ is the additive group of integers.

Affiliated with

Also associated with

No associations

Rating

The edge-flipping group of a graph 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 The edge-flipping group of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The edge-flipping group of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181939