说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 两偶图
1)  bipartite graph
两偶图
2)  bipartite graph
偶图
1.
Uniqueness of cycle length distribution of bipartite graphs;
偶图K_(n,n)-A(|A|=6)圈长分布的唯一性
3)  bigraph ['baiɡrɑ:f]
偶图
1.
Taking the supplying regions as rows of the bigraph, the optimum scheme for looped grids feeder arrangement with minimum cost is obtained by a minimum weight match algorithm of bigraph.
以联络线的建设费用最小为目标函数,将各供电分区作为偶图的2列,采用最小权匹配算法得到"手拉手"环状网的最优配对结果。
2.
This paper presents all the connected simple bigraphs whose energy does not exceed 4,and an inequality about the energy of a graph and the number of the edges of the graph.
本文给出所有能级不超过 4的连通偶图 ,并给出关于图的能级与其边的个数的一个不等式 。
3.
The DM-decomposition algorithm is an automated geometric deduction method based on the DM- decomposition of bigraphs.
几何自动推理的DM-分解算法是一个基于偶图DM-分解的几何自动推理方法。
4)  bi,di,dipl,twi,du
二,双,两,偶
5)  dual graph
对偶图
1.
A brief proof to the key theory "The dual graph T of a simple polygon triangulation S is a tree" is given in the proof of theory "A simple polygon triangulation S is 3-Color".
对“简单多边形三角形化图S是可以3-色”的定理证明中用到的关键定理:“简单多边形三角形化图S的对偶图T是一棵树”作了十分简化的证明,从而简化了3-色问题及Art Gallery问题Watchman定理的证明。
2.
Based on the triangulation of the state space of a robot, a dual graph was constructed following the target attractive principle, and then a path planning algorithm was presented to find a sequence of adjacent triangles that were traversed by the shortest path.
对机器人的状态空间进行三角划分,根据目标吸引原理来建立其对偶图,针对对偶图提出路径规划算法得到最短路径穿越的三角形序列。
6)  complete bipartite graph
完全偶图
1.
This paper presents the formula of enumeration of DS-factors of a complete bipartite graph.
本文研究完全偶图Km,n的DS-因子计数,给出了Km,n的DS-因子计数公式。
2.
Let G be a connected and simple graph with p order, the complement graph G is the union of a complete bipartite graph K n,m and an empty graph K.
设G为p 阶连通简单图,其补图G为完全偶图Kn,m 及空图K的并,笔者利用完全偶图的谱的特性,获得了图G的特征根分
3.
In this paper, we study a necessary and sufficient condition that complete bipartite graph exists factors.
讨论了完全偶图存在 [1,2 ]因子的充分必要条件 ,并给出了 [1,2 ]因子的计数
补充资料:图的减缩图(或称图子式)


图的减缩图(或称图子式)
minor of a graph

图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G,,GZ,…,则存在指标i
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条