更改

* [[Hypercube graph]]s, [[partial cube]]s, and [[median graph]]s are bipartite. In these graphs, the vertices may be labeled by [[bitvector]]s, in such a way that two vertices are adjacent if and only if the corresponding bitvectors differ in a single position. A bipartition may be formed by separating the vertices whose bitvectors have an even number of ones from the vertices with an odd number of ones. Trees and squaregraphs form examples of median graphs, and every median graph is a partial cube.

* [[Hypercube graph]]s, [[partial cube]]s, and [[median graph]]s are bipartite. In these graphs, the vertices may be labeled by [[bitvector]]s, in such a way that two vertices are adjacent if and only if the corresponding bitvectors differ in a single position. A bipartition may be formed by separating the vertices whose bitvectors have an even number of ones from the vertices with an odd number of ones. Trees and squaregraphs form examples of median graphs, and every median graph is a partial cube.

* '''<font color="#ff8000"> 超立方体图Hypercube graph</font>'''，'''<font color="#ff8000"> 局部立方体partial cube</font>'''和'''<font color="#ff8000"> 中位数图median graph</font>'''均为二分图。判别方法是将这些图中的顶点用'''<font color="#ff8000"> 位向量bitvector</font>'''（二进制位组成的向量）进行标记，然后对比其中两个顶点的位向量，发现当且仅当位向量中只有一个位元是不同的时候，该两个顶点相邻。另外判定该图的二分性可以通过观察每个顶点的位向量，奇数位向量和偶数位向量分别为该图的二分顶点子集。树图和方图都是中位数图，而所有中位数图都是局部立方体。

* '''<font color="#ff8000"> 超立方体图Hypercube graph</font>'''，'''<font color="#ff8000"> 局部立方体Partial cube</font>'''和'''<font color="#ff8000"> 中位数图Median graph</font>'''均为二分图。判别方法是将这些图中的顶点用'''<font color="#ff8000"> 位向量Bitvector</font>'''（二进制位组成的向量）进行标记，然后对比其中两个顶点的位向量，发现当且仅当位向量中只有一个位元是不同的时候，该两个顶点相邻。另外判定该图的二分性可以通过观察每个顶点的位向量，奇数位向量和偶数位向量分别为该图的二分顶点子集。树图和方图都是中位数图，而所有中位数图都是局部立方体。

== Properties 属性 ==

== Properties 属性 ==