| 完全四部图Kn,n,n,n（n为偶数）的竞赛数 |
| |
| 引用本文： | 霍京京,何文杰,李明超.完全四部图Kn,n,n,n（n为偶数）的竞赛数[J].河北省科学院学报,2009,26(4):6-10. |
| |
| 作者姓名： | 霍京京 何文杰 李明超 |
| |
| 作者单位： | 1. 河北工程大学理学院,河北,邯郸,056038;河北工业大学理学院应用数学研究所,天津,300401
2. 河北工程大学理学院,河北,邯郸,056038 |
| |
| 摘 要： | 本文利用ECC来给出关于完全四部图Kn,n,n,n（n为偶数）的竞赛数的一些结果：k（Kn,n,n,n）{=2,当n=2;≤n2-7n/2＋7,当n=2m＋2（m=1,2,…）.
|
| 关 键 词： | 竞赛图 竞赛数 完全四部图Kn n |
The competition numbers of complete tetrapartite graphs Kn,n,n,n where n is even |
| |
| HUO Jing-jing,HE Wen-jie,LI Ming-chao.The competition numbers of complete tetrapartite graphs Kn,n,n,n where n is even[J].Journal of The Hebei Academy of Sciences,2009,26(4):6-10. |
| |
| Authors: | HUO Jing-jing HE Wen-jie LI Ming-chao |
| |
| Institution: | HUO Jing-jing1,2,HE Wen-jie2,LI Ming-chao1(1.School of Sciences,Hebei University of Engineering,Handan Hebei 056038,China,2.Applied Mathematics Institute,Hebei University of Technology,Tianjin 300401,China) |
| |
| Abstract: | In this paper,the results about the competition numbers of complete tetrapartite graphs Kn,n,n,n are given where n is even by ECC as follows：k（Kn,n,n,n）{=2, for n=2;≤n2-7n/2＋7, for n=2m＋2（m=1,2,…） |
| |
| Keywords: | n n n |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
