查询词典 connected graph

According to the distances, the SPWUG algorithm computed the initial partition of the coarsest graph by extending the Laplacian spectral graph theory from the unweighted undirected graph into the weighted undirected graph.

SPWUG算法借助Laplacian矩阵次小特征值对应的特征向量，刻画了节点间相对距离，将基于非赋权无向图的Laplacian谱理论在图的剖分应用方面扩展到无向赋权图上，实现了对最小图的初始剖分。

This paper proposed a transformable model of EWDG (edge-weighted directed graph) and VWDG (vertex-weighted directed graph) to resolve the problem of weighted traversal patterns mining. Based on the model, developed a new algorithm, called LGTWFPMiner (local graph traversals-based weighted frequent patterns miner), and its local estimation of support/weight-hound to discover weighted frequent patterns from the traversals on graph with a level property.

为解决加权遍历模式挖掘问题，首先提出了一种从EWDG到VWDG的变换模型；基于这种模型，提出了在具有层次特性的局部图遍历中，挖掘加权频繁模式的LCTWFPMiner（局部图遍历加权频繁模式挖掘法）及其支持度／权值界的局部评枯方法。

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

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

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图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

A graph in which any two vertices are connected by a path is called connected graph.

一个图中如果任意两个顶点都有一条路相连，则称之为连通图。

If any two nodes in a graph can be connected by a path along edges ,the graph is said to be connected.

如果图中任意两个结点间都能够用一条路径沿着边线连接起来，那么该图则被称为连通的。

In chapter 4, we studythe cyclic edge connectedness of regular half vertex transitive graphs, we showthat a connected k(≥4)-regular half vertex transitive graph X with girthg≥6 isλ_c-optimal, and we also obtain a su?cient and necessary conditionfor a connected k(≥4)-regular half vertex transitive graph X with girth 4 tobeλ_c-optimal.

第四章，我们研究了正则半点传递图的圈边连通性问题，主要结果是证明了一个围长为g≥6的k(≥4)-正则连通半点传递图X是λ_c-最优的，并且得到了一个围长为g = 4的k(≥4)-正则连通半点传递图X是λ_c-最优的充分必要条件。

If k = 2 and the graph G corresponding to the wireless sensor network is (l+ max{1,l-4})-connected, or k≥3 and G is l(k-1 + 1-connected, then we can find k disjoint sets each of which completely covers all the targets and remains connected to one of sinks.

当k=2并且网络所对应的图G是(l+max{1，1-4})连通的，或者当k≥3并且G是l(k-1+1连通时，我们能够肯定找到k个不相交的节点集合，每个集合中的节点能够完全覆(来源：ABC929c92论文网www.abclunwen.com)盖所有的目标，并且与网关节点连通。

The invention discloses a denitrify oxidizing lift waste biological reactor stuff field and filter liquid reflux technique, wherein the stuff field comprises a stabilize area, a stable methane area, a positive stuff area, while each area is connected with two filter liquid collecting pool, and each collecting pool is connected with one one-way valve connected with a filter liquid adjusting pool and connected to an on-site treatment sewage processing industry via valves.

本发明公开了属于环保技术领域的一种脱氮兼氧型生活垃圾生物反应器填埋场及渗滤液回灌工艺。填埋场分为稳定区域、稳定产甲烷区域和正在填埋区域，每个区域连接两个渗滤液收集池，每个渗滤液收集池连接一个双向阀，双向阀和渗滤液调节池连接，再经过阀门连接至现场物化处理及至污水处理厂。

The role of the environment is very important.

的作用，环境是非常重要的。

At that time, the High Court of England and Wales Court of Queen's Bench president of William Murray, Lord Mansfield in June 22, 1772 ruling:"No matter then there is the inconvenience, but there must be a decision, I can not say that this case under the law in England are permitted or authorized; are so black should be released."

当时的英格兰及威尔士高等法院王座法庭院长William Murray， Lord Mansfield于1772年6月22日宣判：「无论有那麽不便，但总要有个决定，我不能说这件案在英格兰法律之下是准许或认可；所以黑人是应该被释放。