Enumeration of forests in a graph
C. J. Liu and Yutze Chow
Proc. Amer. Math. Soc. 83 (1981), 659-662
Primary 05C30; Secondary 05C05
Full-text PDF Free Access
Similar Articles |
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.
C. J. Liu and Yutze Chow, Enumeration of connected spanning subgraphs of a planar theory, Acta Math. (to appear).
Harary, Graph theory, Addison-Wesley Publishing Co., Reading,
Mass.-Menlo Park, Calif.-London, 1969. MR 0256911
- C. J. Liu and Yutze Chow, Enumeration of connected spanning subgraphs of a planar theory, Acta Math. (to appear).
- F. Harary, Graph theory, Addison-Wesley, Reading, Mass., 1969. MR 0256911 (41:1566)
Retrieve articles in Proceedings of the American Mathematical Society
Retrieve articles in all journals
© Copyright 1981
American Mathematical Society