Combinatorial identities using the matrix tree theorem.

DOI10.61091/ARS165-04MaRDI QIDQ6855433zbMATH OpenFDO

Authors Chanchal Kumar

Publication date 20 February 2026

Published in Ars Combinatoria (Search for Journal in Brave)

Full work available at URL https://doi.org/10.61091/ARS165-04

zbMATH Keywords

complete bipartite graphscomplete graphsmatrix tree theoremspanning tree enumeration

Mathematics Subject Classification ID

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

This page was built for publication: Combinatorial identities using the matrix tree theorem.

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