二部图的英文

• bigraph
• bipartite graph

• "二"英文翻译    two
• "部"英文翻译    part; section; division; reg ...
• "图"英文翻译    picture; chart; drawing; map
• "二部图 二部图形" 英文翻译 :    bigraphbipartitegraph
• "二部图匹配" 英文翻译 :    bipartite matching
• "二部图形" 英文翻译 :    bigraph
• "二部" 英文翻译 :    bipartite graph; nibu; niibe; two part
• "多部图" 英文翻译 :    partite graph
• "局部图" 英文翻译 :    details / close-up; partial view
• "内部图" 英文翻译 :    interior view
• "细部图" 英文翻译 :    chart, detail; detail drawing
• "第二部" 英文翻译 :    intial_d_second_stage; partes secunda
• "二部的" 英文翻译 :    bijugum
• "二部曲" 英文翻译 :    episode two; guild wars factions
• "二部舞" 英文翻译 :    bal a deux
• "二部制" 英文翻译 :    two-shift system; two part-time shifts◇二部制学校 school with two part-time shifts; two-shift school
• "十二部" 英文翻译 :    twelve divisions
• "标准细部图" 英文翻译 :    standard details
• "船身底部图" 英文翻译 :    view of hull bottom
• "内部图形" 英文翻译 :    enclose pattern
• "丘脑底部图" 英文翻译 :    subthalamogram; subthalmogram
• "外部图象" 英文翻译 :    external image
• "完全n部图" 英文翻译 :    complete n-partite graph
• "膝部图板" 英文翻译 :    knee pad
• "细部图,分图" 英文翻译 :    detail drawing; detaildrawing

• A graph is bipartite if it does not contain an odd cycle .
  一个图是二部图，如果它不包含奇圈。
• Factor - covered and factor - deleted bipartite graphs
  二部图的因子覆盖与因子消去
• On the list colorings of the bipartite graphs and euler graphs
  关于二部图和欧拉图的列表着色
• A class of degree - maximal non - hamilton balanced bipartite graphs
  一类度极大的非哈密尔顿简单平衡二部图
• This graph is not bipartite , since there are many triangles in it
  这个图不是二部图，因为里面存在许多三角形。
• A neural networks used to arrange the lines of shipping transport conforming to two paprts graph
  一种符合二部图的船舶运输神经网络算法
• In this paper , we study asec of a class r - regular partite for r - regular partite graph
  摘要研究了一类正则二部图的邻强边染色，验证了文献[ 1 ]中猜想是正确的。
• It is pointed out that the design of sequences of degree distribution in bipartite graphs is one of the most important problems in constructing low - density erasure codes
  其中二部图度序列的设计是构造低密度纠删码的最关键问题之一。
• To pancyclic graphs , bondy ( 1971 ) proves a classic theorem that every hamiltonian graph of order n and size exceeding n 2 / 4
  关于泛圈图， bondy ( 1971 )证明了下面经典定理：每个边数至少为n ~ 2 / 4的n阶hamiltonian图是泛圈图或完全二部图。
• Comment : a graph is called bipartite if its vertex can be parted into two parts such that every edge connects one vertex in one part and another vertex in another part
  说明：如果能够把一个图的顶点分成两部分，使得每个边连接的两个点，都必然分别在两个部分中，那么称这个图为“二部图” 。

• 二部图的日语：2部グラフ