点图

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

The paper puts forward the regionalization principle according to the structural feature of geographical spatial environment.

本文根据地理空间环境的结构特征提出了分区的原则，在分析研究内容的主要影响因子的基础上，利用多种数据源，在分区指标的支持下进行空间叠置分析，建立采样均质区，形成样点布设支持的空间背景数据库；同时，本文利用组件式地理信息系统的二次开发能力，设计了多种针对采样均质区自动样点布设的方法，样点布设的结果是形成一个点状空间图层；针对如何定位预先设计的采样点问题，本文又提出了采样导航的概念，它是通过GPS和GIS集成实现的，定位信息经过投影转换，实时显示在采样点空间图层上，参照道路、居民点等背景图层进行采样点定位，并根据空间搜索实时寻找最近采样点，当到达采样点时予以提醒，并进行相关的采样。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

In chapter four, we study the second isoperimetric connectivity of line graphs and line digraphs. For line digraphs, we show that the second isoperimetric connectivity of strongly connected line digraphs with δ≥ 2 equals its connectivity. For line graphs, we give a sufficient and necessary condition for the existence of the second isoperimetric connectivity, and we show that under the condition that the second isoperimetric connectivity exists, the second isoperimetric con

第四章研究线图和有向线图的第二等周点连通度，得到了如下结果：(1)最小度大于等于2的强连通有向线图的第二等周点连通度等于它的点连通度；(2)对于无向线图，我们给出了第二等周点连通度存在的充要条件；(3)对于第二等周点连通度存在的无向线图，它的第二等周点连通度或者等于限制点连通度或者等于最小度和次最小度的和。

The main results in this paper as follows: First, a prototype of a shape-based image database retrieval system is completed, it can receive the query mode both by giving an example image and by sketching the desired object on the screen, Second, five shape-based image retrieval methods are realized; Third, an algorithm based on triangulation for shape-based image retrieval is brought forward. In this algorithm, firstly, the edge of the original image is followed and the candidate corners in the original image are detected. Then the counterpoints of the candidate corners in the result of edge follow are found, and the boundary corners whose counterpoints have been found are queued in the order of their counterpoints in edge follow. After these steps, the boundary corners are triangulated and triangles are obtained which can show the true shape of the original image. Finally, shape feature is obtained by calculating the angle histogram of the triangles.

同时本文中主要完成了以下三方面的工作：完成了一个基于形状特征的图象检索的原型系统，可实现例子图象或徒手绘草图两种查询方式；实现了五种利用形状特征进行图象检索的具体方法，并对其进行了分析比较；并且在继承将三角剖分引入形状检索的思想基础上提出了利用三角剖分进行形状检索的一种新算法：先对原图象进行边界跟踪和角点检测；然后寻找初始角点在边界跟踪中的对应点，并对找到对应点的角点按其对应点在边界跟踪中的顺序进行排序；再对排序后的角点进行德洛内三角剖分，得到能表示目标真实形状的三角形序列；最后计算三角形序列的角度直方图作为形状特征，并进行相似性匹配。

Its kind of dead. Maybe you want to add more graphics to jazz it up.

有点闷。也许你可以加点图让它变得生动有趣些。

Maybe you require to add abundance graphics to jazz it up.

也许你没去外国疑问加点图让它变得生动有趣些。

B: Its kind of dead. Maybe you want to add more graphics to jazz it up.

有点闷。也许你可以加点图让它变得生动有趣些。

B: It's kind of dead. Maybe you want toadd more graphics to jazz it up.

有点闷。也许你可以加点图让它变得生动有趣些。

Since historical times,England ,where the early inhabitants were Celts, has been conquered three times .

从有历史以来，英国，在此地早期居住的是凯尔特人，已经被征服了三次。

Bluetooth OBEX File Transfer Enables the sending and receiving of files on your phone via Bluetooth.

蓝牙OBEX文件移动允许经过蓝牙传送和接受文件。。。。