强连通的图

In an LS3PR net, it is verified that there exists a bijective mapping froma strongly connected block of its resource digraph into a strict minimal siphon. In anS3PR net, it is verified that there exists a bijective mapping from a strongly connectedcontributing subdigraph of its contributing resource digraph into a strict minimal siphonin it.

结合Petri网理论和图论，分别给出了LS3PR和S3PR网的资源有向图的概念，分别证明了在资源有向图和有效资源有向图中的强连通块对应LS3PR和S3PR网中的一个严格极小信标的结论。

Recursive algorithm for a directed graph strongly connected component, the input format such as compression packag...

递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。

Using matrix theory,we present a sharp upper bound on the spectral radius of digraph s and strongly connected diagraphs.

利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界

By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.

利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

In chapter four, we study the second isoperimetric connectivity of line graphs and line digraphs. For line digraphs, we show that the second isoperimetric connectivity of strongly connected line digraphs with δ≥ 2 equals its connectivity. For line graphs, we give a sufficient and necessary condition for the existence of the second isoperimetric connectivity, and we show that under the condition that the second isoperimetric connectivity exists, the second isoperimetric con

第四章研究线图和有向线图的第二等周点连通度，得到了如下结果：(1)最小度大于等于2的强连通有向线图的第二等周点连通度等于它的点连通度；(2)对于无向线图，我们给出了第二等周点连通度存在的充要条件；(3)对于第二等周点连通度存在的无向线图，它的第二等周点连通度或者等于限制点连通度或者等于最小度和次最小度的和。

To solve this problem, based on the concept of graph theory we give a few models and arithmetic designs of virtual backbone in the environment of different application, and propose the corresponding routing mechanism with these virtual backbones. The major achievements are outlined as follows:The state of host's power or the time of host's online plays an important role in keeping stability of a virtual backbone. With a view to this feature, the paper introduces a simple and efficient heuristic algorithm for calculating the virtual backbone by seeking a minimum connected dominating set with maximal weight. The maximality of the weight-based choice of backbone nodes guarantees that the most suitable nodes have been chosen for the role of backbone nodes so that they can properly coordinate all the other nodes and keep stability of the virtual backbone in the network.

为了解决这个问题，本文利用网络图论中的一些理论，在不同的应用环境下给出几种虚拟骨干网的模型、构建及基于稳定性和节能的算法设计，并针对这些骨干网提出相应的分层路由机制，主要研究内容和贡献如下：考虑到主机的功率大小和在线时间长短对虚拟骨干中心的相对稳固性的影响，提出用基于极大权的最小连通支配集模拟虚拟骨干网；并给出其数学模型和相应的启发式算法，确保了性能强的主机担任骨干节点；通过优化规则确保骨干网的极小性，有效地减小了控制分组转发开销；最后进行了仿真验证。

Veinott algorithm, which can compute reachable matrix and the period index of strongly connected graphs, respectively.

1即可。算法2 借助了图论中求可达矩阵的Warshall 算法和求强连通图周期指数的Balcer ？

Bipartite matching is adopted to adjust the relations between the constraint equations and variables, and then the matching result is mapped to a data structure named Engineering Constraint Graph. A solving sequence is achieved by topology sort and strong connected component condensation of ECG.

先使用二分图最大匹配调整约束方程与自变量之间的匹配关系，然后将匹配结果映射为工程约束图，通过对工程约束图进行强连通分量凝聚和拓扑排序，得到求解序列。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。