1) Bipartite digraphs
有向二部图
2) strictly directed bipartite graph
严格有向二部图
1.
In this paper, the U-track and strictly directed bipartite graph are defined.
对图的邻接矩阵赋予U-轨道的定义和严格有向二部图的定义,利用U-轨道的定义和Hamilton路的定义论证了严格有向图含有向Hamilton路的充要条件和严格有向二部图为Hamilton图的充分条件。
2.
A sufficient condition of strictly directed bipartite graph with directed Hamiltonian path is given, that is, suppose that D is a strictly directed Bipartite graph on n vertices, (in it V(D)=(X,Y),‖X｜-｜Y‖≤1), if two arbitraily nonadjacent vertices x,y in V(D) have d(x)+d(y)≥2n-4, then D has directed Hamiltonian path.
给出了严格有向二部图含有向Hamilton路的一个充分条件,即:设D是n阶严格有向二部图(其中V(D)=(X,Y),‖X|-|Y‖≤1),若V(D)中任两个不相邻的顶点x,y,都有d(x)+d(y)≥2n-4,则D含有向Hamilton路。
3) oriented weighted bipartite graph
有向赋权二部图
1.
The oriented weighted bipartite graph was built according to the rest star that not fall into the ε-neighborhood region.
针对现有的识别算法存在识别速度慢,识别成功率不高,提出了一种新的星图识别算法,该算法根据恒星星等,利用锚定的方法,使待识别星图中的星落于导航星图中的星的ε邻域,对于未落于ε邻域的星,建立有向赋权二部图,进行完美匹配,根据计算星对之间EMD距离,来确定星图的匹配是否成功;仿真结果表明,该方法提高了星图识别的速度,有很高的成功率;通过与利用Hous-dorff距离进行星图识别的方法比较,该方法对于星数目多时,速度有明显提高。
4) symmetric complete bipartite digraph
对称完全二部有向图
5) oriented bipartite graphs
定向二部图
1.
In this paper, the scores of oriented bipartite graphs are characterized and a criterion for a pair of lists of non-negative integers to be the scores of some oriented bipartite graph is obtained.
我们研究了定向二部图的得分表偶 ,并且得到了关于非负整数表偶是某个定向二部图的得分表偶的一个刻划。
6) orientation bipartite graph
有向二分图
1.
This paper defines two operations: contraction and suppression on a orientation bipartite graph, It presents a topological procedure for writing down the nonprimitive indefinite-admittance matrix from primitive orientation bipartite graph.
本文定义了有向二分图的"缩并"及"封禁"两种运算。
补充资料：《乾隆平定准部回部战图》
| 《乾隆平定准部回部战图》 中国清代宫廷绘画作品。作者郎世宁、王致诚、艾启蒙、安德义。系铜版组画，共16幅，每幅纵55.4厘米 、横90.8厘米。画于乾隆廿九年(1764)，第二年完成，经广州海运至法国 ，由法兰西皇家艺术院制成铜版画，每幅印制200张。作品描绘了清乾隆二十至二十六年，平定蒙古族准噶尔部的阿睦尔撒纳和维吾尔族的布那敦、霍集占叛乱的经过。场面宏大，人物众多，景物繁复，以恢宏的气势和精致细微的手法 ，从《平定伊犁受降》到《凯宴成功诸将》,真实地表现了平叛战斗过程、规模、面貌。 |
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条