Flips in Graphs

Details Flips in Graphs Flips in Graphs

2009-03-12

arxiv.org/abs/0903.2201v1

Mathematics

Combinatorics

Scientific paper

We study a problem motivated by a question related to quantum-error-correcting codes. Combinatorially, it involves the following graph parameter: $$f(G)=\min\set{|A|+|\{x\in V\setminus A : d_A(x)\text{is odd}\}| : A\neq\emptyset},$$ where $V$ is the vertex set of $G$ and $d_A(x)$ is the number of neighbors of $x$ in $A$. We give asymptotically tight estimates of $f$ for the random graph $G_{n,p}$ when $p$ is constant. Also, if $$f(n)=\max\set{f(G): |V(G)|=n}$$ then we show that $f(n)\leq (0.382+o(1))n$.

Affiliated with

Also associated with

No associations

Rating

Flips in 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 Flips in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flips in Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36744