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

DOI10.1016/J.DISC.2008.02.020zbMATH Open1225.05114OpenAlexW1991595759MaRDI QIDQ1024497FDOQ1024497

Authors: 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

Recommendations

• A Gessel--Viennot-type method for cycle systems in a directed graph
• scientific article; zbMATH DE number 6708194
• scientific article; zbMATH DE number 1151814
• Enumeration of Hamiltonian Cycles and Paths in a Graph
• Linear algebraic techniques for weighted spanning tree enumeration

zbMATH Keywords

determinantdirected graphcycle covercycle systemhamburger graphhamburger matrix

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Finding a stabilising switching law for switching nonlinear models
• 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

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