[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.2007.44.2.259

ON NUMBER OF WAYS TO SHELL THE k-DIMENSIONAL TREES

Chae, Gab-Byung (DEPARTMENT OF MATHEMATICS YONSEI UNIVERSITY)
Cheong, Min-Seok (DEPARTMENT OF MATHEMATICS SOGANG UNIVERSITY)
Kim, Sang-Mok (DIVISION OF GENERAL EDUCATION-MATHEMATICS KWANGWOON UNIVERSITY)

Publication Information

Bulletin of the Korean Mathematical Society / v.44, no.2, 2007 , pp. 259-263 More about this Journal

Abstract

Which spheres are shellable?[2]. We present one of them which is the k-tree with n-labeled vertices. We found that the number of ways to shell the k-dimensional trees on n-labeled vertices is $\frac{n!}{(k+1)!}(nk-k^2-k+1)!k$ .

Keywords

k-tree; recursive k-tree; shell;

Citations & Related Records

Times Cited By Web Of Science : 0 (Related Records In Web of Science)
Times Cited By SCOPUS : 0

Reference

1	G. Danaraj and V. Klee, Which spheres are shellable?, Ann. Discrete Math. 2 (1978), 33-52 DOI
2	L. W. Beineke and R. E. Pippert, The number of labeled k-dimensional trees, J. Combinatorial Theory 6 (1969), 200-205 DOI
3	F. Harary, The number of linear, directed, rooted, and connected graphs, Trans. Amer. Math. Soc. 78 (1955), 445-463 DOI ScienceOn
4	F. Harary and E. M. Palmer, On acyclic simplicial complexes, Mathematika 15 (1968), 115-122 DOI
5	E. M. Palmer, On the number of labeled 2-trees, J. Combinatorial Theory 6 (1969), 206-207 DOI
6	N. J. A. Sloane and S. Plouffe, The encyclopedia of integer sequences, With a separately available computer disk. Academic Press, Inc., San Diego, CA, 1995