1) strictly weak digraph
严格弱有向图
2) strict directed digraph
严格有向图
3) 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路。
4) strictly unilateral digraph
严格单侧有向图
5) weak digraph
弱有向图
6) weakly regular digraph
弱正则有向图
1.
In this paper we obtain techniques for computing the characteristic polynomials of ordinary digraphs graph theory and determining relations of characteristic polynomials about weakly regular digraph and its complement.
本文解决了一般有向图的特征多项式的图论计算方法 ,并且给出了弱正则有向图和它的补图之间特征多项式的关系 ,从而也就解决了非负整数方阵特征多项式的图论计算方法问题 。
补充资料：弱弱联合
弱弱联合是指两个总体实力都不强但都拥有自己独特的某方面优势的企业之间进行联合，以形成较强的实力。弱弱联合，弱企业之间优势互补，可以形成整体实力变强的效应。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条