1.
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs.
利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界。
2.
Furhter investigation on strong connectivity of Cayley digraph
Cayley有向图强连通度的进一步研究
3.
The Optimal Arborescences in Qoasi Strongly Connected and Directed Network of Fuzzy Weight
赋模糊权的拟强连通有向网络中的最佳树形图
4.
Judging the Irreducibility of Matrices by Use of the Strong Connexity of Directed Graphs;
利用有向图的强连通性判断方阵的不可约性
5.
Efficient algorithm for computing the connected components of the cycle graph of two signed permutations;
计算有向基因组圈图的连通分支的有效算法
6.
Enumeration of Labeled Oriented Connected Graphs that all of Cut Vertices are in Same Block
所有割点都在一个块上标号有向连通图的计数
7.
A digraph D is unilateral.
有向图d是单连的。
8.
On Cyclability and Strong Pushability in a Kind of Graphs;
关于一类图的可圈性与强连通可推性
9.
Necessary and Sufficient Conditions of Degree Sequences either for Strongly Connected Graphs or Primitive Graphs
强连通图和本原图的度序列的充要条件
10.
k-Restricted Edge Connectivity of a Class of Kautz Graphs
一类无向Kautz图的k限制边连通性
11.
Every tournament can be transformed into a diconnected tournament by the reorientation of just one arc.
每个竞赛图只通过一条弧的改向而转变为双向连通竞赛图。
12.
If enough edges have been drawn to make the figure connected the graph is called bipartite.
如果有足够的线使图连通，这图称为双图。
13.
A tree is a connected graph with no cycles.
一个树是一个没有圈的连通图。
14.
I could probably get them through inter-library loan.
或许我能通过电脑连线向其他图书馆调借书籍.
15.
An Approximation Algorithm for Finding the Longest Path in Undirected Connected Graph under Constrains
无向连通图中求约束条件下近似最长路算法
16.
Research of Network Connectivity Analysis Oriented Attack Graph Generation
面向攻击图构建的网络连通性分析的研究
17.
The Upper Bound on k-Restricted Edge Connectivity of a Class of Kautz Graphs
一类无向Kautz图的k限制边连通度的上界
18.
Connectivity of the Henig Proper Efficient Point (Solution) Set for Vector Optimization
向量优化的Henig真有效点(解)集的连通性