For example, initial substrate of the network may not be a regular graph, but a random graph.
例如，初始网络可能不是一个规则网络，而是一个随机网络。
It is proved that a simple graph G is automorphism line graph if and only if the graph G is 2-regular graph.
首次给出自构线图的定义，并证明：简单图G为自构线图的充要条件是图G为2-正则简单图。
The edge-edge connectivity of a graph is defined, and a class of quasi-regular graphs is proposed with a maximum edge-edge connectivity.
定义了图的边边连通度，设计了一类具有最大边边连通度的拟正则图。
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.
本文利用刘彦佩提出的嵌入的联树模型，得出了两类新的四正则图的完全亏格多项式，并推导出已有结果的两类图的完全亏格多项式。
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.
在刘彦佩提出的联树法的基础上，通过分类一类新图类的可定向嵌入曲面求出了这类图类的可定向嵌入的亏格分布。
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.
研究了任意N阶k正则简单图的生成法则，提出了由简单完全图递归生成任意N阶k正则图的方法。
A graph is regular if every vertex has the same degree.
如果一个图的每个顶点都具有相同的度数，则称它是正则图。
Compared with traditional technology, the present invention has the advantages of shortened etching time, raised etching efficiency, regular edge of resistance stripes and high graph quality.
本发明与传统的方法相比，缩短了刻蚀的时间，提高了刻蚀工艺的效率，电阻条边缘整齐，图形质量高。
A graph is regular if every vertex has the same degree.
如果一个图的每个顶点都具有相同的度数。
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).
首先提出了一个利用映射信息(映射图)将带正则路径表达式的XML查询重写为一组简单路径查询的算法。
A family of graph which is not End-regular is constructed in this paper.
得到了一类自同态幺半群不是正则的图。
Some skills for seeking effective parameters to structure regular cyclic graph are released.
提出寻求有效参数构造正则循环图的新方法。
The (4,6)-regular maximum planar graph is studied, and its existence condition and construction method are obtained respectively.
本文讨论了（4，6）-正则极大平面图，得到了（4，6）-正则极大平面图的存在条件及构造方法。
The (4,6)-regular maximum planar graph is studied, and its existence condition and construction method are obtained respectively.
本文讨论了（4，6）-正则极大平面图，得到了（4，6）-正则极大平面图的存在条件及构造方法。
应用推荐