1) weak digraph
弱有向图
2) 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.
本文解决了一般有向图的特征多项式的图论计算方法 ,并且给出了弱正则有向图和它的补图之间特征多项式的关系 ,从而也就解决了非负整数方阵特征多项式的图论计算方法问题 。
3) weakly connected digraph
弱连通有向图
4) strictly weak digraph
严格弱有向图
5) thin weakly distance-regular diagraphs
非弱距离正则有向图
6) weakly distance-regular digraph
弱距离正则有向图
1.
The lexicographic product Γ′=Γ from Γ to C*r is constructed and the equivalent conditions for it being a weakly distance-regular digraphs is given.
构作了从Γ到Cr*的字典式积图Γ′=Γ[Cr*],给出了Γ′=Γ[Cr*]是弱距离正则有向图的充要条件。
2.
In this paper , we discuss the constructions of lexicographic product and directed product from weakly distance-regular digraphs to undirected graphs, and of lexicographic product from a digraph to a digraph.
本文讨论由弱距离正则有向图到无向图的字典式积、直积及两个有向图字典式积的构作,给出了它们是弱距离正则有向图的等价条件。
补充资料：弱弱联合
弱弱联合是指两个总体实力都不强但都拥有自己独特的某方面优势的企业之间进行联合，以形成较强的实力。弱弱联合，弱企业之间优势互补，可以形成整体实力变强的效应。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条