1) line digraph
有向线图
1.
For a digraph D,the line digraph L(D) is the one whose vertex set is A(D) and the arcs set are the pairs {(xy,yz)},where xy∈A(D),yz∈A(D).
有向图D的有向线图是以A(D)为顶点集,弧集为{(xy,yz),xy∈A(D),yz∈A(D)}的有向图,用L(D)表示D的有向线图。
2.
In this paper,we show that the second isoperimetric connectivity of strongly connected line digraphs with \$δ≥\$ equals its connectivity.
证明了最小度大于等于2的强连通有向线图的第二等周点连通度等于它的点连通度。
2) Line digraph
线有向图
1.
By using the matrix representation of a digraph, some results about the index of convergence and period of a line digraph are obtained.
采用有向图的矩阵表示，得到了线有向图的幂敛指数和周期的有关结果。
3) linedigraph
有向图的线图
1.
The paper shows that the n-dimensional d-ary De Bruijn Graph B(d,n ) is equitable (d+ 1 )-colorable,namely,the set of d" venices of B (d,n ) can be partitioned into d+ 1A vertex coloring theorem of linedigraphs is also proved.
给出了ｎ维ｄ进位ＤｅＢｒｕｉｊｎ图Ｂ（ｄ，ｎ）的一种均匀顶点ｄ＋１染色，即将其顶点集分拆成顶点个数至多相差１的ｄ＋１个无关集，并证明了关于一般有向图的线图的一个顶点染色定理。
4) linear k-partite digraph
线性有向k-部图
1.
This paper introduces the new linear k-partite digraph with single jumping-off and end point.
引入了单源单汇线性有向k-部图,设计了该结构上的删除算法、合并算法和输出算法,在此基础上给出了判断有向图是否含有H回路的多项式时间算法和计算H回路数的多项式时间算法,给出了求解有向图的所有H回路算法,并通过实例验证了算法的有效性,解决了H回路的判定、计数和求解问题。
5) Directed Graph
有向图
1.
Grindability Evaluation of Ceramics with Directed Graph of Analytical Grey Incidence Process;
基于灰关联分析的有向图法评价陶瓷材料的磨削加工性
2.
Tolerance modeling approach to part based on directed graph;
基于有向图的零件容差建模方法
3.
Study on directed graph based workflow modeling and running of the model;
基于有向图的工作流建模及其运行
6) digraph
[英]['daiɡrɑ:f] [美]['daɪ,ɡræf]
有向图
1.
Characteristics of generalized Hadamard matrices and corresponding digraphs;
关于广义Hadamard矩阵及其对应有向图类的特征
2.
Recognition method of directed paths in a digraph;
一种有向图中道路的识别方法
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条