|
There is a certain symmetry in the state bigraph. left-S has about the same neighbors as right-S, except of the different color. ... The graph Φk(G) has all independent sets of G as vertices. Two such vertices are adjacent if the sets S and T are disjoint and |S ∩ T| ≤ k. |