查询词典 connected graph

When the graph Г′ is not connected, Our results are as following: if G is non-solvable then G is a Frobenius group; and if G is solvable then 2≤nl ≤4 for Fitting height nl of G.

我们给出了Γ′不连通时有限群G的结构：当G不可解时，G只能是Frobenius群；而当G可解时，也有2≤nl≤4。

Similarly, a graph X is said to be hyper-connected if every minimum vertex cut creats two components, one of which is an isolated vertex. In [8], D.Wang and J.

类似地，一个图X称为是超连通的，如果对每一个最小割集C，都有X—C只有两个连通分支，且其中一个连通分支为孤立点。

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.

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

Is a minimal connected graph.

是一个极小连通图。

For the purpose of solving the shortest path problem between any two nodes on urban traffic networks, We present a mixed connected graph representing the urban transportation networks, and choice set of main line is proposed in our disertation, according to urban road layout and rule of vehicle rout, we supposed a multi-phase labeling algothrim base on classical Dijskra labeling algorithm, a list of examples for all possible relation between two nodes are provided, all the examples is calculated by the proposed computer program, which indicates that this algorithm is feasible and effective.

为了研究城市路网上任意两顶点间的最短路问题，结合城市交通特点提出了最小干线选择集的概念，在著名的Dijkstra算法基础上，根据城市路网布局和配送车辆行车规则，给出一种多阶段定向搜索标号算法。

In 1991 Faudree et al obtained the 2-connected graph of order n with NC≥n-δ,then it is Hamiltonian.

Faudree等在 1991年得到 N C≥ n -δ条件下熟知的哈密尔顿性结果，其后，一些论文研究 N C2 ≥ n -δ的哈密尔顿图性。

Let G be a connected graph of order n whose algebraic connectivity, vertex connectivity, and edge connectivity are α,κ, and λ, respectively.

n阶连通图G的代数连通度、点连通度和边连通度分别记作α，κ和λ。

In [29], the author gave that let G be a 2-connected graph with order n and S ≥ t, if |N ∪ N|≥ n - t for any nonadjacent vertices u and v in G, then G is pancyclic or n = 2t, G ≌ K_.

在[29]中，作者给出定理：设G是一个n阶2-连通图，且δ≥t，若对G中的任意两个不相邻的点u和v有|N∪N|≥n-t，那么G是一个泛圈图或n=2t，G≌K_。

We determine the bounds on the upperand lower orientable strong radius and strong diameter of graphs satisfyingthe Ore condition. Let G_1, G_2 be any connected graph, we present the exactvalue of srad(G_1×G_2), consider the relationship between sdiam(G_1×G_2) andr(G_1×G_2), d (G_1×G_2). Moreover, we determine the values of the lower orientablestrong diameters of some special graphs. Furthermore, we give the exact value ofSDIAM, a lower bound for SDIAM, an upper and lowerbound for SRAD and SRAD, respectively.

对满足Ore条件的图，给出了最小强半径、最大强半径的上、下界；对笛卡尔乘积图G_1×G_2，确定了G_1×G_2的最小强半径与G_1×G_2的半径以及G_1和G_2的最小强直径之间的关系，并进而确定了一些特殊笛卡尔乘积图的最小强直径的值，确定了SDIAM的值，SDIAM的下界，SRAD和SRAD相应的上、下界。

A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

一个构形是面图的一连串连通的顶点与这些顶点的度。

There had been a moment during the breakfast meeting, though, after the backslapping and the small talk and when all of us were seated, with Vice President Cheney eating his eggs Benedict impassively and Karl Rove at the far end of the table discreetly checking his BlackBerry, that I witnessed a different side of the man.

那次早餐会期间，在表示过关心和寒暄以后，我们所有人坐了下来，我注意观察了一下，副总统切尼面无表情地吃着班尼迪克蛋（Eggs benedict，源自美国，以英式松饼、火腿、水煮蛋以及荷兰酱组合而成），卡尔。罗夫在餐桌的远端谨慎地经常查看他的黑莓手机，我目睹了他所不为人知的一面。

Talk Undelete failed; someone else may have undeleted the page first.

Talk 无法删除选定的页面或图像（它可能已经被其他人删除了）。