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

From MaRDI portal

Revision as of 06:59, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3666880

Jump to:navigation, search

DOI10.4153/CJM-1982-035-0zbMath0518.05042MaRDI QIDQ3666880

David M. Jackson, Ian P. Goulden

Publication date: 1982

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

zbMATH Keywords

rooted labelled tree adjacency matrix matrix tree theorem edge partition Lagrangian methods

Mathematics Subject Classification ID

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

Related Items (3)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3666880&oldid=17127305"