|
|||||
|
|
A new way of counting n |
|
| Authors: | Young-Ching Deng Yue-Li Wang Jou-Ming Chang |
| Affiliation: | Department of Information Management National Taiwan Institute of Technology, Taipei, Taiwan 10772, R.O.C. Department of Electronic Data Processing National Taipei College of Business, Taipei, Taiwan, R.O.C. |
| Abstract: | In this paper, we shall give a combinatorial proof of the following equation: where m and n are positive integers, m ≤ n, and k1, k2, …, kn-1 are nonnegative integers. |
| Keywords: | Graph theory Combinatorial enumeration Forest |
| 本文献已被 ScienceDirect 等数据库收录！ | |
