最小图

The Graphical Representations of Connected Cubic Arc-Transitive Coset Graphs of Minimum Degree on Projective Special Linear Group PSL2,p

特殊射影群PSL(2，p)的最小级连通3度弧传递陪集图表示论文标题：特殊射影群PSL(2，p)的最小级连通3度弧传递陪集图表示

It includes the definition of two basic operations, logical functions expansion and matrix formulation in OR-Coincidence algebra system, and the introduction of map expression--dj map, the complete research of the relations among CRM expansion^ maxteim expansion and RM expansion, iiamely tie relations among dj map, K-map and bj map, also includes the minimization of CRM expansion in fixed and mixed polarities-Meanwhile this dissertation points out the form and properties of basic symmetric function, simple symmetric function and basic CRM symmetric function in OR-Coincidence algebra system, discusses the relations and transform methods among the coefficients of the three kinds of symmetric functions.

包括连和与加合两种基本运算的定义，逻辑函数在或、符合代数系统里的展开式及矩阵表示式，展开式图形表示--d_i图的引入，对CRM展开式和最大项展开式、RM展开式，d_i图和K图、b_i图之间的关系及转换方法进行了较为全面的研究，以及CRM展开式在固定极性和混合极性下的最小化问题。

In chapter two, concepts of integrity, integral set and integral number are introduced firstly, and then some relationships between the integrity and some other parameters of graphs are given, then the upper and lower bounds of the integrity are investigated on the basis of integral number determined. The final result is the upper and lower bounds of integral number if the integrity is known.

第二部分主要讨论了完整度与图的其它参数之间的关系；给出了完整度给定条件下完整数的最大可能值及完整数给定条件下，完整度的最大最小可能值；给出了图的完整度与此图的删点子图的完整度之间的关系。

With the use of Petri net simulator,nondirectional trans...

即用Petri网图仿真器把无向运输网络转化为有向运输网络，然后求有向运输网络 G的对偶网络 DG，再用 Petri网图仿真器将对偶网络 DG转换成 Petri图模型，并自动求得 DG最短路(原网络 G的最小割容量)，即运输网络最大流。

In this thesis, we mainly study one of the topics in graph theory with applications: the extremal values of unicyclic graphs and unicyclic chemical graphs of the first general Zagreb index;the extremal values of bicyclic graphs of the second Zagreb index;the extremal values of unicyclic graphs of the general Randic index.

本论文主要研究了图论及其应用中的一个方面：图论在化学中的应用-单圈图以及化学单圈图的第一广义Zagreb指标的极值，双圈图的第二Zagreb指标的最小值以及单圈图的广义Randi指标在某个范围的最小值。

In a graph-theoretic version for a graph G,it is to find a set F of added edges such that the graph G+F is chordal and |F| is minimized.Here the minimum value |F| is called the finll-in number of G,denoted as f.

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G+F是弦图。

The fill-in minimization problem comes from the elimination process of sparse matrix computation. In a graph-theoretic version for a graph G, it is to find a set F of added edges such that the graph G+F is chordal and |F| is minimized.

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G+F是弦图。

On the one hand, the component method is introduced into flowchart design, which can not only enlarge the depth and the connotation of the flowchart, but also extend the traditional concepts of the flowchart. By combining the component method and the objectoriented method, it will be easy to illustrate the industry flow and meet with the future requirements of the industry control software. On the other hand, the trajectory concepts in plane moving, the method of using Bezier Curve to approach the 1/4 arc to implement the arc circumrotation, the method of using graphic elements' combination to extend the expression capability, and the method of combining the graphic elements'combination, three-dimensional graphic elements and bitmaps to realize the three-dimensional effects to express the industry flow more realistic are brought forward in this dissertation.

工控软件中最能够体现人机接口设计创造性的画面当属流程图，本文对流程图设计进行了深入研究，提出了一种工控软件流程图设计的新方法：一方面在流程图设计中引入部件化方法，扩展流程图的深度与内涵，延伸了流程图的传统概念与意义，将部件化技术与面向对象技术相结合，能够更好地实现对工艺过程的描述并适应工控软件的未来发展要求；另一方面对流程图中动画关联和三维化这些新兴领域进行了研究，提出了平移动画中的&轨道&概念，以实现图元的沿曲线平移，提出了在圆弧旋转动画中用Bezier曲线逼近〓圆弧的工程化方法，并用最小二乘法进行了验证和工程化参数的获取，实现了利用图元组合来扩展流程图的表达能力，采用了图元组合、三维图元和位图相结合的方法来实现逼真的三维效果，以使工控软件更加符合人机工学，更能形象地反映工艺流程。

Lit.[1,2]study the minimum genera of edge amalgamations for complete graphs and complete bipartite graphs,respcctivly.Here,the minimum genera of edge amalgamations for n given graphs are obtained.

文献分别讨论了完全图与完全图，完全二部图与完全二部图边合并的最小亏格问题，本章给出了n个特定图边合并的最小亏格。

Based on the properties of associated surfaces for complete bipartite graphs,a new type of graph J with weak symmetry is constructed.At the same time,the minimum genus of it is derived.Finally,the number of genus embeddings of complete bipartite graphs is easily estimated.

然后基于完全二部图关联曲面的特点进行推广，构造了对称性比较弱的新图类J且得其最小亏格，最后对完全二部图不同最小亏格嵌入的数目作了估算。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。