This paper gives necessary and sufficient conditions of strongly connected graphs and primitive graphs through degree sequences.
本文通过度序列分别给出一个图是强连通图和本原图的充要条件。
Necessary and Sufficient Conditions of Degree Sequences either for Strongly Connected Graphs or Primitive Graphs
强连通图和本原图的度序列的充要条件
On Cyclability and Strong Pushability in a Kind of Graphs;
关于一类图的可圈性与强连通可推性
Furhter investigation on strong connectivity of Cayley digraph
Cayley有向图强连通度的进一步研究
The Optimal Arborescences in Qoasi Strongly Connected and Directed Network of Fuzzy Weight
赋模糊权的拟强连通有向网络中的最佳树形图
Judging the Irreducibility of Matrices by Use of the Strong Connexity of Directed Graphs;
利用有向图的强连通性判断方阵的不可约性
Study on Some Properties of R-strong Connectivity and locally R-strong Connectivity
R-强连通和局部R-强连通的一些性质
The Wiener Indices of Connected Graph and Disconnected Graph;
连通图和不连通图的维纳指数W(G)
Independence Number、Connectivity and Hamilton-connectivity;
图的独立数、连通度与Hamilton连通性
The Connectivity of <E_C(G)>IN 3,4-Connected Graph;
3,4-连通图G中<E_C(G)>的连通性
The Relationship of Connected Matroid M and Connected Graph G(D~#)
M是连通拟阵与G(D~#)是连通图的关系
G is a minimal connected graph.
G是一个极小连通图。
5-connected Graphs and the Hamilton Question;
5-连通图与Hamilton问题
Connectivity of Two Classes of Bi-Cayley Graphs;
两类Bi-Cayley图的连通性
Restricted Edge Connectivity of de Bruijn Digraphs and Graphs;
de Bruijn图的限制边连通度
An Algorithm of Constructing a Connected Graph from a Connectible Sequence;
可连通图序列的一个连通图实现的构造算法
The Degree Sequence of Connected Graphs and the Number of Lower Degree Vertices of Connected Plannar Graphs
连通图的度序列及连通平面图的低度点个数
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs.
利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界。
Some Properties of Self-Central Graph of Minimum 2-Edge- Connected Graphs
极小2—棱—连通图中自中图的一些性质