大家在查：对角矩阵磁导负指数分布影子价格刘维尔函数条件数切比雪夫函数土壤含水量位温双伽玛函数

连通图

n.connected graph; connectivity
网络connectivity graph theory; How Many Tables; M esh

连通图

连通图

英-汉网络释义

连通图

connected graph

2008年7月10日随笔档案 - 两颗番茄 - 博客园 ... connected component 连通分量 connected graph 连通图 critical path 关键路 …

connectivity graph theory

How Many Tables

九度考研机试教程题集-九度Online... ... 畅通工程 More is better 连通图 How Many Tables 还是畅通工程 Freckles ...

M esh

控制拓扑结构一般是由组播成员构成的连通图( M esh) , 组播成员之间周期性地交换控制信息, 负责监视连接节点的变化、以维 …

1

For a set of connected graphs , a spanning subgraph of a graph is called an -factor if every component of is isomorphic to a member of .

给定连通图集合，对图的生成子图，如果的每个分支都同构于集合的一个元素，则被称为的 -因子。

2

An undirected connected graph with no cycles is called a tree . A vertex with degree equal to one in a tree is called a leaf.

一个无环无向连通图称为一棵树。树中一个度为一的点称为叶子结点。

3

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

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

4

If a graph is connected and every vertex is of even degree, then it at least has one euler circuit .

如果一个连通图每个点都是偶点，则该图至少有一个欧拉圈。

5

6

Visual arts graduate student Ian Wojtowicz mashed that with NASA's well-known map showing Earth at night , and the above is what you get .

视觉艺术专业的研究生 IanWojtowicz 将 NASA 著名的 “晚间地球 ”与那幅 Facebook 连通图结合起来制成了这张图，上面你所看到的就是。

7

According to this algorithm, an initial R-edge-connectivity graph is formed. Then the cost is reduced by iteratively exchanging edges.

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

8

Nature of A kind of Maximal Critically h-Connected Graphs

一类极大临界 h 连通图的性质

9

The Number of Removable Edges in a Spanning Tree of a 3 -Connected Graph

3 -连通图支撑树上的可去边数

10

An Approximation Algorithm for Finding the Longest Path in Undirected Connected Graph under Constrains

无向连通图中求约束条件下近似最长路算法

12

Removable edges in a spanning tree of a 3-connected graph

3 连通图生成树上的可去边

13

The Count of Spanning Trees Containing Certain Appointed Edges in Connected Graph

连通图中含某些指定边的生成树的计数

14

Two New Sufficient Conditions for Traceable and Almost Traceable Graphs

连通图可迹及几乎可迹的两个新充分条件

15

Pathconnected Graphs with Neighborhood Union Conditions

泛连通图和邻域并条件

16

The (Adjacent ) Tree Graph of a Connected Graph Is Upper Embeddable

连通图的（邻接）树图的上可嵌入性

17

The Judging Between Single Connected Graph and Strong Connected Graph

单侧连通图与强连通图的判定

18

Large Cycles Passing Through a Specified Edge in 2 -connected Graphs

2 -连通图过指定边的长圈

19

An implicit degree condition for hamiltonian cycles in k-connected graphs

k-连通图中存在哈密尔顿圈的一个隐度条件

20

An Algorithm for Finding the Articulation Points of Connected Graph

连通图中关节点的判定算法

21

Application of connected in engineering design

连通图在工程设计中的应用

22

Adjoint Uniqueness of Three Families of Connected Graphs

三类连通图的伴随唯一性

23

Method of Value Computing of Sum of Products Formula in the Connected Graph 's Relevant Matrix

连通图的关联矩阵的积和式的计值方法

24

The existence theorem of contractible edges in h-connected graphs

h-连通图中可收缩边的存在定理

25

New Method of Searching Articulation Points of Connected Graph

求解连通图关节点的一种新的思考方法

26

The Algorithm of Judging Euler Entry (or Circuit ) in Connected Graph

判定连通图中欧拉通路（或回路）的算法

27

Lower Bound for the Maximum Genus of Connected Graphs

连通图的最大亏格的下界

28

The Number of Non-essential Edges in Minimally 3-Connected Graphs

极小 3 连通图的非基本边数

29

Covering a connected graph with bonds of minimum total size

连通图的极小键覆盖

30

Finding bridges in undirected graph

求无向连通图中的桥

热词推荐

大家在看