|
|||||
|
|
| (m,n)—树的计数公式 | |
| 引用本文： | 邓志云,柳柏濂. (m,n)—树的计数公式[J]. 数学的实践与认识, 2004, 34(9): 157-163 |
| 作者姓名： | 邓志云 柳柏濂 |
| 作者单位： | 1. 井冈山师范学院数学系,江西,吉安,343009 2. 华南师范大学数学系,广东,广州,510633 |
| 摘 要： | Beineke和 Pippert[1,2 ] 将树的概念推广到高维空间 ,后来 Dewdney[3] 又进一步把它推广到 n维复形上 ,得到了 (m,n) —树的概念 .本文在 n维复形领域 ,利用 (m,n) —树的图论特征和组合的方法 ,独立地得出了顶点标号的 (m,n)—树的计数公式 . |
| 关 键 词： | (m,n)—树 计数公式 完全图 |
| 修稿时间： | 2004-02-28 |
The Counting Formula of (m,n)-tree |
|
| DENG Zhi-yun ,LIU Bo-lian. The Counting Formula of (m,n)-tree[J]. Mathematics in Practice and Theory, 2004, 34(9): 157-163 | |
| Authors: | DENG Zhi-yun LIU Bo-lian |
| Affiliation: | DENG Zhi-yun 1,LIU Bo-lian 2 |
| Abstract: | Tree was extended in higher dimensional space by Beineke and Pippert [1,2] . Later it was developed further in n-dimensional complex by Dewdney [3] , and the concept of (m, n)-tree was obtained. In this paper, the formula of labeled (m, n)-tree is gave independently by the character of (m, n)-tree in graph and combinatorial way in n-dimensional complex. |
| Keywords: | (m n)-tree counting formula complete graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |