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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call