A certain polynomial of a graph and graphs with an extremal number of trees
- 1 June 1974
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 16 (3), 197-214
- https://doi.org/10.1016/0095-8956(74)90065-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Enumeration of spanning trees in certain graphsIEEE Transactions on Circuit Theory, 1970
- Formulas for the number of trees in certain incomplete graphsJournal of the Franklin Institute, 1970
- The Number of Trees in a NetworkIEEE Transactions on Circuit Theory, 1966
- Generating formulas for the number of trees in a graphJournal of the Franklin Institute, 1964
- Formulas for the Number of Trees in a NetworkIRE Transactions on Circuit Theory, 1961
- Méthode de détermination des arbres d’un réseauAnnals of Telecommunications, 1950
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847