Applying a combinatorial determinant to count weighted cycle systems in a directed graph

DOI10.1016/j.disc.2008.02.020zbMath1225.05114OpenAlexW1991595759MaRDI QIDQ1024497

Christopher R. H. Hanusa

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.020

zbMATH Keywords

directed graphdeterminantcycle covercycle systemhamburger graphhamburger matrix

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (1)

Finding a stabilising switching law for switching nonlinear models

Cites Work

• A Gessel--Viennot-type method for cycle systems in a directed graph

This page was built for publication: Applying a combinatorial determinant to count weighted cycle systems in a directed graph