IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v19y1973i5p582-584.html
   My bibliography  Save this article

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

Author

Listed:
  • Robert B. Cooper

    (Georgia Institute of Technology)

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.

Suggested Citation

  • Robert B. Cooper, 1973. "Note--Derivation from Queueing Theory of an Identity Related to Abel's Generalization of the Binomial Theorem, which is Useful in Graph Theory," Management Science, INFORMS, vol. 19(5), pages 582-584, January.
    • Handle: RePEc:inm:ormnsc:v:19:y:1973:i:5:p:582-584
    DOI: 10.1287/mnsc.19.5.582
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.19.5.582
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.19.5.582?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:19:y:1973:i:5:p:582-584. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.