| 阶数最小的A(H)=4的非树图 |
| |
| 引用本文： | 李明哲. 阶数最小的A(H)=4的非树图[J]. 哈尔滨师范大学自然科学学报, 2003, 19(5): 10-13 |
| |
| 作者姓名： | 李明哲 |
| |
| 作者单位： | 哈尔滨学院 |
| |
| 摘 要： | 本文构作了全部阶数最小的A(H)=4的非树图,它们的阶数为7．
|
| 关 键 词： | 联系数 A(H)值 阶数 |
| 修稿时间： | 2003-08-11 |
THE LEAST ORDER GRAPHS WITH A (H) = 4 THAT ARE NOT TREES |
| |
| Li Mingzhe. THE LEAST ORDER GRAPHS WITH A (H) = 4 THAT ARE NOT TREES[J]. Natural Science Journal of Harbin Normal University, 2003, 19(5): 10-13 |
| |
| Authors: | Li Mingzhe |
| |
| Affiliation: | Harbin College |
| |
| Abstract: | In this paper, we find out eight graphs that are not trees, and prove they are the least order graphs with A(H)=4. |
| |
| Keywords: | Eccentricity Parameter A(H) Order |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
