Enumeration of forests in a graph
HTML articles powered by AMS MathViewer
- by C. J. Liu and Yutze Chow
- Proc. Amer. Math. Soc. 83 (1981), 659-662
- DOI: https://doi.org/10.1090/S0002-9939-1981-0627715-2
- PDF | Request permission
Abstract:
The enumeration of forests of different orders in a graph is carried out by a procedure that involves formal sums and certain annihilation operators on the space of such sums. The results here extend the well-known matrix-tree theorem to the general case of forests.References
- C. J. Liu and Yutze Chow, Enumeration of connected spanning subgraphs of a planar theory, Acta Math. (to appear).
- Frank Harary, Graph theory, Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.-London 1969. MR 0256911
Bibliographic Information
- © Copyright 1981 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 83 (1981), 659-662
- MSC: Primary 05C30; Secondary 05C05
- DOI: https://doi.org/10.1090/S0002-9939-1981-0627715-2
- MathSciNet review: 627715