| The degree sequence of a bipartite graph is the pair of lists each containing the degrees of the two parts <math>U</math> and <math>V</math>. For example, the complete bipartite graph K<sub>3,5</sub> has degree sequence <math>(5,5,5),(3,3,3,3,3)</math>. Isomorphic bipartite graphs have the same degree sequence. However, the degree sequence does not, in general, uniquely identify a bipartite graph; in some cases, non-isomorphic bipartite graphs may have the same degree sequence. | | The degree sequence of a bipartite graph is the pair of lists each containing the degrees of the two parts <math>U</math> and <math>V</math>. For example, the complete bipartite graph K<sub>3,5</sub> has degree sequence <math>(5,5,5),(3,3,3,3,3)</math>. Isomorphic bipartite graphs have the same degree sequence. However, the degree sequence does not, in general, uniquely identify a bipartite graph; in some cases, non-isomorphic bipartite graphs may have the same degree sequence. |
− | 一个二分图的度数序列是一对列表,每个列表包含两个部分U和V的度数。例如,完全二分图K3,5具有度数序列(5,5,5),(3,3,3,3,3)。其'''<font color="#ff8000"> 同构二分图Isomorphic bipartite graphs</font>'''具有相同的度数序列。但是,度数序列通常不是定义二分图的唯一方法;在某些情况下,非同构二分图可能具有相同的度数序列。
| + | 一个二分图的度数序列是一对列表,每个列表包含两个部分''U''和''V''的度数。例如,完全二分图''K3,5''具有度数序列(5,5,5),(3,3,3,3,3)。其'''<font color="#ff8000"> 同构二分图Isomorphic bipartite graphs</font>'''具有相同的度数序列。但是,度数序列通常不是定义二分图的唯一方法;在某些情况下,非同构二分图可能具有相同的度数序列。 |