1) regular graph
正则图
1.
Ranks of line graphs of regular graphs Cartesian product;
正则图Cartesian积的线图的秩
2.
Some results of regular graphs on the existence of balanced partition
关于正则图存在平衡划分的一些结果
2) regular graphs
正则图
1.
In this article,regular graphs of order 4n has been proved on the basis of study on the construction of edge-gracefulness of a kind of even-order odd regular graphs.
通过研究一类偶阶奇正则图的构造,证明了4n阶(2r+1)-正则图,当r>1时,不是边优美图,当r=1时,则是边优美图并且是k-边优美图。
2.
In this article,we study the restricted edge connectivity of strong product and lexicographic product of regular graphs.
本文研究正则图的强乘积图和字典乘积图的限制边连通性。
3.
In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.
本文研究正则图的笛卡尔乘积图与直接乘积图的限制边连通性。
3) strong regular graph
强正则图
1.
Let G be a strong regular graph(denoted by srg in short) with parameters(n,k,λ,μ).
设G是一个具有参数(n,k,λ,μ)的强正则图,首先讨论了图G的一些性质以及参数n,k,λ和μ之间的关系,特别地,提出了一个关于参数n,k,λ和μ的整性条件。
4) s-regular graphs
s-正则图
5) semiregular graphs
半正则图
6) four regular graph
四正则图
1.
According to this system, the paper shows the algorithm that can generate the graph example of the four regular graph with any number of vertices and determines its bipolar orientation and bipolar numbering, and draws its rectilinear embedding graph.
刘彦佩教授论述的纵横嵌入术已为超大规模集成电路 (VLSI)的平面设计提供了较完备的理论体系 ,本文以此为依据建立的算法能自动生成任意点数的四正则图例 ,并对其进行双极定向和双极标数 ,进而画出其纵横嵌入图 。
补充资料：凡事豫则立，不豫则废
1.谓做任何事情，事先谋虑准备就会成功，否则就要失败。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条