G is a minimal connected graph.

是一个极小连通图。

In this paper, the bond cover of a connected graph was studied.

对连通图的键覆盖进行了研究。

We shall see that a tree can be defined as a connected graph which contains no circuits.

我们将看到树可以定义为一个不包含回路的连通图。

Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph.

本文中引进了连通图的森林图，它是树图的推广。

An edge of a 6 connected graph is said to be 6-contractible if its contraction results still in a 6 connected graph.

如果6连通图的一条边收缩后使得所得到的图仍是6连通，则这条边称为6可收缩边。

G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.

一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。

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.

给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。

It seems as though, if you can't create a fully connected graph because you have too many nodes, the next best thing would be to create a tree of some kind.

看起来好像，如果你不能创建一个完全连接的图，因为你有太多的节点，下一个最好的事情是创建一个类型的树。

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.

本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。

The researchers, who are from various institutions in Italy, explain that their model consists of agents that are represented by nodes in a sparsely connected graph.

这些来自意大利不同学院的研究员们解释道，他们的模型由稀疏图中节点代表的代理组成。

The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.

针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。

I like the idea that it creates a fully connected graph of nodes, but upon reading different articles online, it seems as though this doesn't scale well (having a Max of 50-100 nodes).

我喜欢它创建一个完全连接的节点图，但在在线阅读不同的文章，似乎这不能很好地扩展(最多有50 - 100个节点)的想法。

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.

讨论收缩临界5 -连通图最长路和最长圈上5度点的分布情况，刻画收缩临界5 -连通图的结构。

Such a cluster of buttons is called a “connected component” in a “random graph”, where a graph is just a set of nodes connected by lines.

这种成集群的钮扣被称为“随机图”中的“相互连接着的组件”，其中的"图"就是一些由线连接的节点的集合。

The nodes of the graph are resources and literals, and they are connected by directed edges, which are labeled with predicates.

图的节点是资源和文字，节点之间用有向边连接，边上用谓词标记。

They will be deleted for you when you drop your client reference to them, and they are not connected to a data graph.

当丢弃对其的客户机引用且未连接到数据图时，会将其自动删除。

From this filtered data, a graph was built for email that was connected in some way (for example, referring to the same link in the email message body).

根据过滤的这些数据，对以特定方式(例如参考电子邮件正文中的相同链接)连接的邮件生成一个图表。

No matter how the graph is drawn, we want to show there is a set of three points that are all connected or a set of three points that has no connecting edges.

不管怎样画，我们要画出有三个点总是连接的，另外的三个点总是没有连接。

You can visualize a DirectedGraph as a 2-d graph that has a finite number of Nodes, with each Node located at some Point, and the adjacent Nodes joined (or connected) to each other by Edges.

您可以将DirectedGraph形象化为拥有有限数量的Node的一个2 - d图形，在该图形中，每个Node都位于一些Point上，相邻的Node是通过Edges连接在一起的。

Right now our social graph (whom we are connected to and their key information like email addresses) is mostly held captive by Facebook.

现在，Facebook获知了我们大部分的社交网络（我们的联系人和他们的联系方式如email地址），Facebook正经历着越来越多的压力去把这些信息变得便携。

SDOs become much more capable when they are connected to form a graph of objects.

若将 SDO 彼此连接在一起构成对象图，它们将拥有更为强大的能力。

So applying that warrior spirit to data, Quid amasses company-specific "key words, patents and press mentions to create a graph that shows how the companies are connected."

Quid软件将武士精神应用到数据分析上，搜集特定公司的“关键词、专利和新闻提及次数来制作图像，显示企业之间的相互联系。”

For simplicity we assume that the graph of the network is connected.

为了简便起见，假设网络的图是连通的。

Based on the algorithm to find strongly connected nodes of a graph, this paper presents a linear time algorithm to detect modules of a fault tree.

基于在图中寻找强连接节点的算法，给出一种线性时间复杂度算法来检测故障树中的模块。

In a graph, a vertex in a tree can be connected to any number of other vertices, provided that no cycles are created.

在图中，树的顶点可以连接任意数量的顶点，只要不存在环即可。

Deleting selected nodes in this mode causes connected nodes to disappear from the graph.

在这个模式删除选取的节点，会让连接的节点从图形中消失。

The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.

算法的输入是一个有向图，产生一个图的强连通分量顶点划分。

Serializes an object, or graph of connected objects, to the given stream.

将对象或连接对象图形序列化为给定流。

The number of 3-nodes connected induced subgraphs S3(G) in a graph G plays a important role in the reliability of a network.

一个图G中所含的三结点连通导出子图的个数记为S_3（G），它在网络可靠性中起着重要作用。