A combinatorial identity with applications to forest graphs
arXiv:1902.03470
Abstract
We give an elementary proof of an interesting combinatorial identity which is of particular interest in graph theory and its applications. Two applications to enumeration of forests with closed-form expressions are given.
11 pages. Most recent version including a new application (Theorem 3 pp. 3) and 2 graphics (Figures 1 and 2 pp. 10). To appear in Discrete Mathematics (journal)