摘要
Beineke和 Pippert[1,2 ] 将树的概念推广到高维空间 ,后来 Dewdney[3] 又进一步把它推广到 n维复形上 ,得到了 (m,n) —树的概念 .本文在 n维复形领域 ,利用 (m,n) —树的图论特征和组合的方法 ,独立地得出了顶点标号的 (m,n)—树的计数公式 .
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.
出处
《数学的实践与认识》
CSCD
北大核心
2004年第9期157-163,共7页
Mathematics in Practice and Theory
基金
国家自然科学基金项目资助 (1 0 3 3 1 0 2 0 )
