英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

bipartite    
a. 由两部组成的,有两分的,裂开为二的

由两部组成的,有两分的,裂开为二的

bipartite
adj 1: divided into two portions almost to the base
2: involving two parts or elements; "a bipartite document"; "a
two-way treaty" [synonym: {bipartite}, {two-part}, {two-way}]

Bipartite \Bip"ar*tite\, a. [L. bipartitus, p. p. of bipartire;
bis twice partire. See {Partite}.]
1. Being in two parts; having two correspondent parts, as a
legal contract or writing, one for each party; shared by
two; as, a bipartite treaty.
[1913 Webster]

2. Divided into two parts almost to the base, as a leaf;
consisting of two parts or subdivisions. --Gray.
[1913 Webster]

49 Moby Thesaurus words for "bipartite":
apart, asunder, biaxial, bicameral, bicuspid, bifid, biform,
bifurcated, bilateral, binocular, binomial, binominal, bipartisan,
biped, bipetalous, bipinnate, bisexual, bivalent, dichotomous,
discontinuous, discrete, distinct, divergent, double, duadic, dual,
dualistic, duplex, duplicated, dyadic, identical, in two,
incoherent, insular, matched, noncohesive, partitioned, separate,
twain, twin, twinned, two, two-sided, unassociated, unattached,
unattended, unconnected, unibivalent, unjoined


请选择你想看的字典辞典：
单词字典翻译
bipartite查看　bipartite　在百度字典中的解释百度英翻中〔查看〕
bipartite查看　bipartite　在Google字典中的解释Google英翻中〔查看〕
bipartite查看　bipartite　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • discrete mathematics - How to tell if a graph is bipartite . . .
    Well, bipartite graphs are precisely the class of graphs that are 2-colorable Recall a coloring is an assignment of colors to the vertices of the graph such that no two adjacent vertices receive the same color
  • prove $n$-cube is bipartite - Mathematics Stack Exchange
    Hint: If a graph is bipartite, it means that you can color the vertices such that every black vertex is connected to a white vertex and vice versa Hint: Consider parity of the sum of coordinates Share
  • Prove that all trees are bipartite - Mathematics Stack Exchange
    This process continues until all vertices have been added to this isomorphic tree, call it T' We can partition the vertices of T' into two groups, A and B A will contain all vertices from even numbered rows of T', and B will contain all vertices from odd numbered rows from T' Thus, we've created a bipartition of T', so T is a bipartite graph
  • graph theory - Is $K_1$ bipartite? - Mathematics Stack Exchange
    Stack Exchange Network Stack Exchange network consists of 183 Q A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers
  • bipartite graph vs. directed acyclic graph - Mathematics Stack Exchange
    A directed acyclic graph need not be bipartite, and a directed bipartite graph need not be acyclic For example, the graph on 3 vertices with directed edges $\{v_1 \rightarrow v_2, v_1 \rightarrow v_3, v_2 \rightarrow v_3\}$ is a directed acyclic graph, but is not bipartite
  • Why is a bipartite graph in which every vertex has degree exactly
    This question is simply not true, since there are the existence of disconnected bipartite graphs The graph of two disjoint 4-cycles is a simple counterexample of this If we assume that the graph is connected, then the requirement of the bipartite graph is unneeded, as this new condition alone suffices to prove that the graph is a cycle
  • Proof a graph is bipartite if and only if it contains no odd cycles
    $\begingroup$ I don't agree with you in the textbook of Diestel, he mentiond König's theorem in page 30, and he mentiond the question of this site in page 14 he didn't say at all any similiarities between the two
  • Example for adjacency matrix of a bipartite graph
    When a (simple) graph is "bipartite" it means that the edges always have an endpoint in each one of the two "parts" So if the vertices are taken in order, first from one part and then from another, the adjacency matrix will have a block matrix form: $$ A = \begin{pmatrix} 0 B \\ B^T 0 \end{pmatrix} $$
  • Conditions for a bipartite graph - Mathematics Stack Exchange
    In the bipartite graph on the left, the red nodes are only ever connected to blue nodes and vice-versa I've highlighted a cycle of length $5$ in the non-bipartite graph, since you never find odd-length cycles in bipartite graphs - it would be impossible to make the colouring described for the other graph
  • Intuitive reason behind the fact that the definition of bipartite graph . . .
    Whether we want to allow non-simple graphs to be bipartite or not is heavily dependent on context Of course, the definition of "bipartite" is easily generalised to graphs that are not simple, and we might want to do this in some cases: for instance if we are studying graph colourability, we might want to use "bipartite" as synonymous with "$2$-colourable"





中文字典-英文字典  2005-2009