Note--Derivation from Queueing Theory of an Identity Related to Abel's Generalization of the Binomial Theorem, which is Useful in Graph Theory

Robert B. Cooper
Additional contact information
Robert B. Cooper: Georgia Institute of Technology

Management Science, 1973, vol. 19, issue 5, 582-584

Abstract: A well-known theorem of graph theory gives a simple formula for the calculation of the number of spanning trees of a complete graph with n labeled vertices. A well-known proof of this theorem uses a combinatorial identity, related to Abel's generalization of the binomial theorem, that is difficult to prove from first principles. It is the purpose of this note to observe that this identity is an easy consequence of an analysis of the busy period for the single-server queue with Poisson input and constant service times.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.5.582 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:19:y:1973:i:5:p:582-584

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().