1) biweighted graph
双权图
1.
This paper studied the biweighted graph with a new weighted graph and denoted by G=(V,E;w,c).
本文讨论一类新的赋权图 ,称为双权图 ,G=( V,E;w,c) ,w称为权函数 ,c为容量函数 。
2) weight bipartite association graph
双向加权联合图
3) graph weight
图权
1.
Considering the shortage of graph spectral thresholding method with a great deal of computation because of graph weight computation method adopting power exponential function based on Euclidean distance,the new computation method of graph weights are proposed by mean.
考虑到现有的图谱阈值法中图权计算方法采用基于欧氏距离的幂指数函数导致其计算量过大的不足,首先采用基于欧氏距离的分式型柯西函数代替基于欧氏距离的幂指数函数提出图权计算的新方法,其次将其应用基于图谱划分测度的图像阈值分割算法中并得到一种改进的图谱阈值分割方法。
4) weight graph
权图
1.
In an undirectional weight graph G(n,m),H cycle of arbitrary start-node can be divided into two matched half-paths.
无向权图G(n,m)的任始结点哈密顿回路可分成两条匹配半路径,根据给定λ值,用最小权路径延长法,对所有相关半路径进行匹配,便可完全确定从最短到λ阶短哈密顿回路的匹配法和相应的匹配算法。
2.
The minimal weight method to solve λ level short Hamilton cycle of weight graph G(n,m) is obtained by analysis of the features of the shortest Hamilton resulted from extended.
提出短哈密顿回路的概念,分析由延长而形成最短哈密顿回路的特点,得出求权图G(n,m)λ阶短哈密顿回路的最小权法。
5) two-weight
双权
1.
Two-weight Integral Inequalities for Differential Forms;
微分形式的双权积分不等式
2.
Then gets two-weight Poincar inequality for differential forms.
首先定义了Arλ3(λ1,λ2,Ω)-权,进而得到微分形式的双权Poincaré不等式。
3.
A local two-weight Caccioppoli-type Inequality for weak solutions to A-harmonic equation has been established.
研究形如div A(x,u(x))=0的A-调和方程,证明了其弱解满足局部Aλr双权Caccioppoli型不等式。
6) double graph
双图
1.
The double graph is defined as D[G] = G×T_2, where×stands for direct productof graphs and T2 is a total graph with 2 vertices, which is obtained from the completegraph K2 by adding a loop to every vertex.
一个图G的双图(double graphs)定义为D[G] = G×T_2,这里×表示图的直积,而T2表示两个顶点的全图。
补充资料：因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权
因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权：公民、法人的姓名权、名称权，名誉权、荣誉权、受到侵害的有权要求停止侵害，恢复名誉，消除影响，赔礼道歉，并可以要求赔偿损失。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条