1) 2-regular maps
近2-正则地图
1.
Meanwhile,we consider a kind of maps:nearly 2-regular maps, topologically equivalent to petal bundles.
与此同时,考虑一类与瓣丛拓扑等价的地图类:(无环,简单)近2-正则地图,通过一种组合方法,给出了多参数下平面近2-正则地图的计数显式,亦得到了任意亏格曲面上该类地图的具体个数。
2) 2-regular graph
2-正则图
1.
The cordiality of 2-regular graphs is studied and the sufficient and necessary condition for 2-regular graphs G to be cordial is given.
研究2-正则图G的cordial性,证明了2-正则图G是cordial图的充要条件为|G|≠2(mod4);取消了文献[1](Cahit I。
2.
m_s~(n_s))denotes a 2-regular graph consisting of n_i cycles of length m_i,i=1,2,.
"用记号C(m_1~(n_1)m_2~(n_2)…m_s~(n_s))表示由n_i个m_i长圈,i=1,2,…,s组成的2-正则图。
3) rooted nearly 2-regular planar map
带根近二正则平面地图
1.
This paper investigates the enumeration of rooted nearly 2-regular planar maps,provides the enumerating equations satisfied by enumerating functions with the valency of root-face,and the number of edges as two parameters.
研究了带根近二正则平面地图的计数问题,提供了以根面次和边数为参数的计数函数所满足的计数方程,并导出了一些计数显式。
4) regular maps
正则地图
5) cubic maps
3-正则地图
6) induced 2-regular subgraph
诱导2-正则子图
1.
Let us define c(G) the length of the longest induced cycle in G and c (G) the maximal order of an induced 2-regular subgraph of G.
设G是2-连通图,c(G)是图G的最长诱导圈的长度, c’(G)是图G的最 长诱导2-正则子图的长度。
补充资料:凡事豫则立,不豫则废
1.谓做任何事情,事先谋虑准备就会成功,否则就要失败。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条