查询词典 bipartite

Most of community detection algorithms are used in dealing with unipartite networks, and there are few algorithms designed for detecting communities in bipartite networks, and these algorithms have some weaknesses respectively. For example, the community detection algorithm proposed by Guimera can not utilize weight information of a bipartite network; the algorithm proposed by Barber can not deal with the complex mapping situation of communities in bipartite network.

目前社团检测算法大多用于处理单元网络，而专门用于处理二分网络的社团检测算法不多，而且这些算法都存在着各自的不足之处，如 Guimera 所提的二分图社团检测算法无法处理边含权重信息的二分网络； Barber 所提的社团检测算法无法处理二分网络中具有复杂社团对应关系的情况。

When 〓 is the family of bipartite graphs,the 〓 capacityand the 〓 valency of a graph G are referred to as the biparticitydenoted by β(Gand the bivalencydenoted by 〓(Gof G respectively;when 〓 is the family ofgraphs whose components are complete bipartite graphs,the 〓 capacity and the〓 valency of a graph G are referred to as the complete biparticitydenoted byc(Gand the complete bipartite valencydenoted by 〓(Gof G respectively;andwhen 〓 is the family of star forests,the 〓 capacity and the 〓 valency of a graphG are referred to as the star arboricitydenoted by st(Gand the star valency ofG(denoted by 〓)respectively.

以v记图G的完全二部分解中顶点υ所关联的π中完全二部图的个数，记〓这里π取遍G的所有完全二部分解。我们称υ为G的完全二部次。对一般的图，当图的阶数充分大时，P。〓和L.Pyber给出了υ的一个上界，即，〓。F.R.K.Chung等人及Z.Tuza的结果说明这一上界是不可改进的。对υ的具体值，即使是对某些特殊的图类，结果也知之甚少。P.C.Fishburn和P.L.Hammer给出了一个相关的结果：当n≤16时，〓，（在υ的定义中，以完全二部覆盖替代完全二部分解，即得〓。同时他们提出了下述公开问题。问题1。〓=？

In Chapter 2, we characterize the bipartite graphs whose graph of perfect matching polytope is bipartite graph.

在这章的最后，我们列举了本文的主要研究成果。

A complete bipartite graph is a simple bipartite graph with bipartition.

完全偶图是具有二分类的简单偶图。

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

In this paper well verify that it is true for tree(a special type of bipartite graph)vertex-multiplications, and it is a extention to one of the results in paper.In the second chapter, from the point of view of non-decreasing degree sequence we give a degree-maximal non-Hamilton simple balanced bipartite graph bm,n. We give a result below.

第二章中从图的不减度序列角度给出了一类度极大的非哈密尔顿简单平衡二部图，并且证明了：任何非哈密尔顿的简单平衡二部图，它的不减度序列一定弱于此类图中的某个图b_的度序列。

In Chapter 2, we characterize the bipartite graphs with given number of vertices and edges which have the smallest and largest values of the sum of squares of degrees. Meanwhile, we present some bipartite graphs attaining extreme values.

在论文的第二章里，给出了n个顶点m条边的偶图的度平方和的最大值和最小值，同时给出了达到极值的一种极图的构造方法。

In the last chapter,we constructa bipartite graph by all 1-dimensional subspaces and all maximal totally isotropicsubspaces of symplectic space,and obtain that this graph is a distance-semiregulargraph,its bipartite half is the complement of symplectic graph.

最后，我们利用辛空间中的所有一维向量子空间及极大全迷向子空间构作了一类二部图，证明了此图是一个距离半正则图，其二部半图是辛图的补图。

Based on the properties of associated surfaces for complete bipartite graphs,a new type of graph J with weak symmetry is constructed.At the same time,the minimum genus of it is derived.Finally,the number of genus embeddings of complete bipartite graphs is easily estimated.

然后基于完全二部图关联曲面的特点进行推广，构造了对称性比较弱的新图类J且得其最小亏格，最后对完全二部图不同最小亏格嵌入的数目作了估算。

In the fourth chapter, we shall determine the adjacent vertex distinguishing incidence chromatic number of complete bipartite graphs, C_m,·F_n graphs and one type ofθ- graph.

在第四章中我们将确定完全二部图、C_m·F_n图及一类θ-图的邻点可区别关联色数。

You have to walk your own alk in this life.

次生中你必须走自己的路。

To start with, the thesis analyses ***ism in terms of the generic masculine words, word order and semantic derogation of women in greater detail.

论文首先从阳性词泛指，词序，词义的贬降等方面对英语中的性别歧视现象进行了详细的分析。