Tree counting polynomials for labelled graphs part I: Properties
- 1 December 1981
- journal article
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 312 (6) , 417-430
- https://doi.org/10.1016/0016-0032(81)90053-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Stirling number identities from chromatic polynomialsJournal of Combinatorial Theory, Series A, 1978
- σ-polynomials and graph coloringJournal of Combinatorial Theory, Series B, 1978
- Nonisomorphic trees with the same T-polynomialInformation Processing Letters, 1977
- Comparison of graphs by their number of spanning treesDiscrete Mathematics, 1976
- Coefficient relationship between rook and chromatic polynomialsJournal of the Franklin Institute, 1976
- A certain polynomial of a graph and graphs with an extremal number of treesJournal of Combinatorial Theory, Series B, 1974
- Properties and Applications of a Class of PolynomialsJournal of the Franklin Institute, 1973
- The characteristic polynomial of a graphJournal of Combinatorial Theory, Series B, 1972
- Generating formulas for the number of trees in a graphJournal of the Franklin Institute, 1964
- An analysis of the Wang algebra of networksTransactions of the American Mathematical Society, 1959