| 完全二部图k_(4,n)去掉两条边的交叉数 |
| |
| 引用本文： | 贺佩玲.完全二部图k_(4,n)去掉两条边的交叉数[J].衡阳师专学报,2008(6). |
| |
| 作者姓名： | 贺佩玲 |
| |
| 作者单位： | 湖南人文科技学院经济与管理科学系 |
| |
| 基金项目： | 湖南人文科技学院青年基金资助项目(2008QN021) |
| |
| 摘 要： | 用km,n表示完全二部图,用k4,n\e1,e2表示完全二部图k4,n去掉两条边e1、e2。本文确定了K4,n\e1,e2的交叉数为z(4,n)-22n+2。K4,n\e1,e2。
|
| 关 键 词： | 完全二部图 交叉数 画法 |
The Crossing Number of the Complete Bipartite Graph by Deleting Two Edges e_1 and e_2 |
| |
| HE Pei-ling.The Crossing Number of the Complete Bipartite Graph by Deleting Two Edges e_1 and e_2[J].Journal of Hengyang Normal University,2008(6). |
| |
| Authors: | HE Pei-ling |
| |
| Institution: | HE Pei-ling(Department of Economy and Management; Hunan Institute of Humanties; Science and Technology Loudi; Loudi Hunan 417000; China); |
| |
| Abstract: | Let km,n denote the complete bipartite graph,and K4,n\e1,e2 denote the graph obtained from by deleting two edges e1 and e2.In this paper,we will determine the crossing number of K4,n\e1,e2 is z(4,n)-2+2. |
| |
| Keywords: | the complete bipartite graph crossing number drawing |
| 本文献已被 维普 等数据库收录！ |
|
