对连通图的键覆盖进行了研究。
In this paper, the bond cover of a connected graph was studied.
是一个极小连通图。
本文中引进了连通图的森林图，它是树图的推广。
Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph.
我们将看到树可以定义为一个不包含回路的连通图。
We shall see that a tree can be defined as a connected graph which contains no circuits.
拓扑排序算法既可以用于连通图，也可以用于非连通图。
The topological sorting algorithm works on unconnected graphs as well as connected graphs.
若有向图D中任何两个顶点是互相可达的，则称D为强连通图。
A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.
同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
并通过比较这些极值图的最小根得到此类连通图族伴随多项式最小根的序。
Moreover, some ordering relations are determined by comparing the minimum roots of these extreme graphs.
本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。
The paper gives out an effective calculating method RMA, which changes an arbitrary non-directed graph into a R-side connected graph with minimum enhancement.
如果6连通图的一条边收缩后使得所得到的图仍是6连通，则这条边称为6可收缩边。
An edge of a 6 connected graph is said to be 6-contractible if its contraction results still in a 6 connected graph.
本文我们利用带权核子图的可重构性证明了连通图是可重构的，从而证明了重构猜想为真。
In this paper, we use the reconstructibility of weighted nuclear subgraphs and it is proved that connected graphs are reconstructible.
图的可收缩边与可去边是研究连通图的构造和使用归纳法证明连通图的一些性质的有力工具。
Contractible edges and removable edges in connected graphs are a powerful tool to study the structures of connected graphs and to prove some properties of connected graphs by induction.
先使用一种矢量化的直线提取算法在游程连通图的基础上得到表格线，同时对表格进行倾斜校正。
We use a vectorization algorithm to extract form lines from run length connect graph which is calculated first, and in the same time the skew Angle is detected.
利用组合理论和图的计数理论，讨论了只含有一个非平凡块的连通图的计数问题，给出了新的结论。
The enumeration problem for connective graphs with one nontrivial block was discussed by the theory of combinatorics, and the new conclusion is also given.
讨论收缩临界5 -连通图最长路和最长圈上5度点的分布情况，刻画收缩临界5 -连通图的结构。
In this paper we discuss the distribution of vertices of degree 5 on the longest path and cycle and thus give a characterization of contraction critical 5-connected graph in a certain aspect.
其优点在于，算法统一、方法简单、容易实现、便于修改，并且易于并行化，可以直接用来画非连通图。
The advantages of the method are: unified algorithms, simplicity, easy modification and parallelism, and it can be used to draw non connected graphs directly.
根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。
The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block.
让我们深入研究Graphviz，了便理解如何从连通矩阵生成一个调用图。
Let's dig into Graphviz to understand how a call graph is generated from the connectivity matrix.
要组织这些用例，或者至少连通要管理的所有范围，您可能决定生成一个或更多的用例图。
To organize these use cases, or at least to communicate the overall scope to management, you might decide to create one or more use-case diagrams.
图6.2，在本例中，我们将使用具有POP3连通性的ESB从邮件服务器接收电子邮件，并把该电子邮件消息发送给文件系统。
Figure 6.2 Example where we receive an E-mail from a mail server using the ESB with POP3 connectivity and sent the E-mail message to the file system.
图3中的图表显示这次活动的连通性和硬件需求的高级视图。
The diagram in Figure 3 shows a high-level view of the connectivity and hardware requirements for this event.
连通性、最大通路和最小通路以及其他图和矩阵的概念在本章中都进行了介绍。
Connectivity, maxima and minima, and other graph and matrix concepts are explained here.
为了简便起见，假设网络的图是连通的。
For simplicity we assume that the graph of the network is connected.
如果一个图是不连通的或有割点，就发生这种情况。
This happens if the graph is disconnected or has a cut vertex.
这些关系都可以用网络图的连通性或可靠性的知识来解决。
These relationships can be clarified with the knowledge of the connectivity or reliability of network.
本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph.
加权图的连通扩充问题已被证明是NP完全问题。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
本文利用连通循环图及其连通度的有关性质，得到了构造具有最佳连通性的循环网络的定理。
Using the properties of circulant graphs and its connectivity, the theorems about constructing a network with optimal connectedness have been obtained in this paper.
应用推荐