正则图

词组短语

planar graph

与正则图相关的网络例句 [注：此内容来源于网络，仅供参考]

Then we prove the one-to-one corresponding relation between 3-coloring of inducing four regular graph and 4-coloring of maximal planar graph and find out the relation between three colors of inducing four regular graph and three dual bi-chromatic subgraph of maximal planar graph.

本文给出了极大平面图的导出四正则图的两种构造方式、等价性及性质，证明了导出四正则图的三着色与原极大平面图四着色的一一对应关系，并且找出了导出四正则图的三种颜色与原极大平面图四着色的三组对偶二色子图之间的关系。

By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.

利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

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次幂的方法，指出度数定理的实际应用。

We study the recursive structure of the twisted-cube connected network sufficiently, and prove that the twisted-cube connected network is an n regular graph with connectivity n: point out that the twisted-cube connected network is a cube-free network, which is an essential distinction with the hypercube and other variations of the hypercube; prove that the diameter of n dimensional twisted-cube connected network is [ (n+1)/2] , which is almost the half of hypercube's.

首先对其结构的递归性进行充分地研究，证明它是连通度为n的n正则图；指出扭立方体连接网络无立方体子图，这是扭立方体连接网络与超立方体及其其它变种的本质差别；证明了n维扭立方体连接网络的直径为[（n+1）/2]，它几乎是超立方体直径的一半；最后，给出超立方体及其变种的等价定义，并对它们的结构递归性、网络参数和拓扑性质等作了简单的分析、综合和比较。

The spectral properties of strongly regular multigraphs are studied in Section 3, we show that they can be haracterized as multigraphs with exactly three distinct eigenvalues, we show further when they are strongly regular graphs in terms of their eigenvalues.

我们在第三节证明强正则重边图和强正则图相同，均为具有三个相异的特徵值所刻画。针对具有三个相异特徵值的图，我们找出其分别对应於强正则图和强正则重边图的条件。

In the last chapter,we constructa bipartite graph by all 1-dimensional subspaces and all maximal totally isotropicsubspaces of symplectic space,and obtain that this graph is a distance-semiregulargraph,its bipartite half is the complement of symplectic graph.

最后，我们利用辛空间中的所有一维向量子空间及极大全迷向子空间构作了一类二部图，证明了此图是一个距离半正则图，其二部半图是辛图的补图。

A graph F is said to be semisymmetric if it is regular and Aut acts transitively on its edge set but not on its vertex set.

称X为边传递图，如果Aut_E在E上是传递置换群，边传递而点不传递的正则图叫做半对称图。

Give a simple undirect regular graph X.

设X是简单无向正则图。

The classification of distance regular graphs is one of the most important problem at all.

距离正则图的分类问题一直是距离正则图研究中的一个重要的问题。

At the basis of them, In this paper, by calculating adjacency characteristic polynomial, the number of closedcircuit, using the property that bipartite graphs with same Laplacian spectrum must be Line-cospectral and the property of graphs with the same eigenvalues and angles to study some non-regular graphs with special structure.

在前人的基础上，本文通过计算图的邻接特征多项式，闭路数目，利用二部图同Laplacian谱必Line-同谱的性质，以及有相同特征值和角的图的一些特点来研究一些特殊结构的非正则图的谱确定问题，得到了如下一些结论：(1)两个不同构的C_(n_1，(n_2)，(n_3)，(n_4)图没有相同的邻接谱。

与正则图相关的网络解释 [注：此内容来源于网络，仅供参考]

canonically labeled tree：正则标志树

canonical transition matrix | 规范转移矩阵 | canonically labeled tree | 正则标志树 | canonization vectogram | 规范化向量图

Regular Directed Graph：正则有向图

图有向递归集:directed graph recursive set | 正则有向图:Regular Directed Graph | 无圈有向图:directed graph without a ring

regular left ideal：正则左理想

regular layout 有规则布局图 | regular left ideal 正则左理想 | regular lightship 正规灯船

line oriented macro scheme：面向行的宏功能方案

line-indices | 反射线指数(X射线) | line-oriented macro scheme | 面向行的宏功能方案 | line-regular graph | 线正则图

regular function：全纯函数

regular fixed point 正则不动点 | regular function 全纯函数 | regular graph of degree n n次正则图

regularly homotopic：正则同伦[的]

正则条件概率|regular conditional probability | 正则同伦[的]|regularly homotopic | 正则图|regular graph

regularized semivariogram：正则化半方差图

regularized covariance 正则化协方差 | regularized semivariogram 正则化半方差图 | regularized variogram 正则化方差图

regularized variogram：正则化方差图

regularized semivariogram 正则化半方差图 | regularized variogram 正则化方差图 | regulate 调节

regularized covariance：正则化协方差

regularization 规则化 | regularized covariance 正则化协方差 | regularized semivariogram 正则化半方差图

liaisons graph：关联图

拓扑图:topological graph | 关联图:liaisons graph | 正则图:Normal graph