The Application of Lagrangian Methods to the Enumeration of Labelled Trees with Respect to Edge Partition

DOI10.4153/CJM-1982-035-0zbMATH Open0518.05042MaRDI QIDQ3666880FDOQ3666880

Authors: David M. Jackson, I. P. Goulden 

Publication date: 1982

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixmatrix tree theoremedge partitionLagrangian methodsrooted labelled tree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Cited In (3)

• A combinatorial proof of the multivariable Lagrange inversion formula
• The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods
• Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti

This page was built for publication: The Application of Lagrangian Methods to the Enumeration of Labelled Trees with Respect to Edge Partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666880)