连通图

关于p阶临界2边连通图的一个注记

A Note on the p Critical 2 - Edge - Connected Graph

n阶极小2&连通图的若干性质

Some properties of n order minimally 2 & connected graphs

极小n棱连通图的着色与棱数

The Coloring and Edge Number of Minimal n-Edge Connected Graph

关于临界n连通图的一些性质

Some Properties of on Critical n - Connected Graphs

h连通图中非临界点的个数

The Number of Non - Critical Vertices in h - Connected Graphs

首先形成一个初始R边连通图，通过边交换来迭代降低边集的费用；

According to this algorithm , an initial R-edge-connectivity graph is formed .

3,4-连通图G中的连通性

The Connectivity of IN 3 , 4 - Connected Graph

极小n边连通图的几个性质

On some properties of minimally n-edge connected graphs

关于临界h连通图的几个结论

On the Conclusions of the Critical h Connection Chart

k连通图为Dλ连通的一个充分条件

A Sufficient Condition for k-connected Graphs to be D_ λ - connected

设G是一个有限的简单连通图。

Let G be a simple finite connected graph .

阶较小时具有最大棱数的极小k棱连通图

Minimally k-line-connected graphs of low order with maximal size

连通图和不连通图的维纳指数W（G）

The Wiener Indices of Connected Graph and Disconnected Graph ;

泛连通图定理和Ore2条件

Theorem of Path Connected Graphs and Ore_2 Conditions

有向k连通图和有向混合（p，q）连通图的结构

The Structure of k-Connected Digraph and Mixed ( p , q ) - Connected Digraph

恰有k条非基本边的极小3连通图

Minimally 3-Connected Graphs with Exactly k Non-Essential Edges

G是一个极小连通图。

G is a minimal connected graph .

具有围长g的连通图的周长

Circumference of Connected Graph with Girth g

K连通图的k分割多项式算法

A polynomial algorithm of finding a K partition for an undirected simple k connected graph

证明n个顶点的收缩临界5连通图中至少有n+1条平凡不可收缩边。

It is proved that any contraction critical 5-connected graph on n vertices has at least n + 1 trivially non-contractible edges .

设G为n阶简单连通图，ρ（G）为图G的邻接谱半径。

Let G be a simple connected graph with n vertices and ρ( G ) be the adjacency spectral radius of G.

定理8H是连通图G的一个子图。

Theorem 8 Suppose H is a subgraph of a connected graph G.

采用连通图中极小支配集概念对平面分布的adhoc网络进行层次划分；

We use distributed minimum dominating set algorithm to construct a hierarchical architecture for mobile Ad hoc networks ;

令G（V，E）是简单图，Ore研究了不相邻两点情况的哈密尔顿连通图。

Let G ( V , E ) be simple graph , Ore studied Hamilton connected graphs with any nonadjacent two vertices .

关于几乎正则2-连通图的Hamilton性的注记

A Note on Hamilton Cycles in Almost-Regular 2-Connected Graphs

最小度与Hamilton连通图

The minimum degree and Hamilton - connected graphs

设C是k-连通图G（2≤k≤6）的一个最长圈.H是G-C的一个分支。

Let C be a Longest cycle in a k-connected graph G and let H be a component of G-C.

Hamiltonian连通图的一个范－型条件

A fan type condition for Hamiltonian connected graphs

本文研究了以最小或近似最小权值的边集扩充一个任意无向加权图为K边连通图，文中给出了一个近似算法，为网络的可靠性设计和改建提供了一个新方法。

An approximation algorithm is presented for augmenting an undirected weighted graph to a K-edge-connected graph . The algorithm is useful for designing a realizable network .

以图论知识为基础，应用连通图中的k树树支导纳乘积，给出网络函数及其灵敏度分析的符号表达式。

Based on network graph theory , using admittance product of k-tree branches in connected graph , the symbolic expression of network function and its sensitivity are presented .