| 广义置换图的最大亏格(英文) |
| |
| 引用本文： | 马登举,任韩.广义置换图的最大亏格(英文)[J].东北数学,2008,24(3). |
| |
| 作者姓名： | 马登举 任韩 |
| |
| 作者单位： | School of Science;Nantong University;Nantong;Department of Mathematics;East China Normal University; |
| |
| 基金项目： | 国家自然科学基金
，
the Scientific Fund
，
国家自然科学基金
|
| |
| 摘 要： | In this paper we prove that the generalized permutation graph G(n,k) is upper embeddable if it has at most two odd subcycles,and that the maximum genus of G(n,k) is more thanβ(G(n,k))/3]in most cases.
|
| 关 键 词： | 广义置换图 最大亏格 图论 数学分析 |
Maximum Genus of the Generalized Permutation Graph |
| |
| MA Deng-ju,REN Han.Maximum Genus of the Generalized Permutation Graph[J].Northeastern Mathematical Journal,2008,24(3). |
| |
| Authors: | MA Deng-ju REN Han |
| |
| Institution: | [1]School of Science, Nantong University, Nantong, Jiangsu, 226007 [2]Department of Mathematics, East China Normal University, Shanghai, 200062 |
| |
| Abstract: | In this paper we prove that the generalized permutation graph G(n, k) is upper embeddable if it has at most two odd subcycles, and that the maximum genus of G(n,k) is more than β(G(n,k))/3] in most cases. |
| |
| Keywords: | generalized permutation graph maximum genus upper embeddable |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
