如果一个图的每个顶点都具有相同的度数，则称它是正则图。
本文研究正则图的笛卡尔乘积图与直接乘积图的限制边连通性。
In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.
距离正则图的分类问题一直是距离正则图研究中的一个重要的问题。
The classification of distance regular graphs is one of the most important problem at all.
定义了图的边边连通度，设计了一类具有最大边边连通度的拟正则图。
The edge-edge connectivity of a graph is defined, and a class of quasi-regular graphs is proposed with a maximum edge-edge connectivity.
这篇论文分为两部分，分别讨论了三正则图的列表线性荫度和线性可选性。
The thesis is divided into two parts, which consist of some results on list linear arboricity of cubic graphs and linear choosability of cubic graphs, respectively.
本文给出了关于准正则图的五个等价命题，使我们可以更好了解准正则图的本质。
This paper gives five equivalent propositions for almost regular graphs, and so that we can see the almost regular graphs better.
利用距离正则图的特征值方法和交叉数的性质，证明了具有下列交叉阵列的距离正则图是不存在的。
By using the eigenvalue techniques and properties of intersection Numbers, it is obtained that the distance regular graphs with the following intersection arrays are nonexistence.
研究了任意N阶k正则简单图的生成法则，提出了由简单完全图递归生成任意N阶k正则图的方法。
The generative rule of arbitrary N-rank K-regular simple graph is studied, and the method of recursively generating arbitrary N-rank K-regular graph from the simple complete graph is put forward.
本文利用刘彦佩提出的嵌入的联树模型，得出了两类新的四正则图的完全亏格多项式，并推导出已有结果的两类图的完全亏格多项式。
In this paper, We obtain the total genus polynomials for two new classes of 4-regular graphs by using the joint tree model of a graph embedding introduced by Yanpei Liu.
最近提出的外部信息转移图是一种优化非正则LDPC码的简单高效方法。
The recently proposed extrinsic information transfer(EXIT) chart is a powerful yet simple method for optimizing irregular low-density parity-check (LDPC) codes.
本文讨论了（4，6）-正则极大平面图，得到了（4，6）-正则极大平面图的存在条件及构造方法。
The (4,6)-regular maximum planar graph is studied, and its existence condition and construction method are obtained respectively.
首先提出了一个利用映射信息(映射图)将带正则路径表达式的XML查询重写为一组简单路径查询的算法。
At first, an algorithm is proposed, which rewrites a regular path expression based XML query as a group of simple path expression based queries using mapping information (mapping graph).
在这篇文章中，我们研究了素数阶对称图的齐分解，其中M在顶点集上作用是正则的。
In this paper we study homogeneous factorisations of symmetric graphs of prime order such that M acts regularly on vertices.
本文讨论连续的图在几种图运算下的连续性，证明了几类特殊图是连续的，并得到它们的非正则和以及非正则强度的界。
In this paper, we mainly study consecution of consecutive graph under several operations. also we determine bounds of irregularity strength and (g) for there classes of graphs.
首次给出自构线图的定义，并证明：简单图G为自构线图的充要条件是图G为2-正则简单图。
It is proved that a simple graph G is automorphism line graph if and only if the graph G is 2-regular graph.
刻划了具有P -正则自同态幺半群的二分图，讨论了字典序积图的自同态幺半群的P -正则性。
Bipartite graphs with P-regular endomorphism monoids are characterized. P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed.
提出寻求有效参数构造正则循环图的新方法。
Some skills for seeking effective parameters to structure regular cyclic graph are released.
得到了一类自同态幺半群不是正则的图。
A family of graph which is not End-regular is constructed in this paper.
各子频段采用不同的正则化算子。实验结果表明该算法的盲图象恢复的性能优于空域算法。
The experiment results show that the proposed algorithm is superior to the general spatial domain in the quality of the restored image.
提出一种基于小波变换的迭代正则化图象恢复算法，兼顾抑制噪声的增长和保留图象重要边界。
A wavelet based on iteration regularized image restoration algorithm is presented. Consideration is given to both the noise suppression and edge preservation.
提出一种基于小波变换的迭代正则化图象恢复算法，兼顾抑制噪声的增长和保留图象重要边界。
A wavelet based on iteration regularized image restoration algorithm is presented. Consideration is given to both the noise suppression and edge preservation.
应用推荐