Determinants of weighted path matrices

2012/02/14 by Kelli Talaska, Talaska, Kelli · 1 citation
Engineering · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1202.3128

openalex publication_date 2012/02/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We find rational expressions for all minors of the weighted path matrix of a directed graph, generalizing the classical Lindstrom/Gessel-Viennot result for acyclic directed graphs. The formulas are given in terms of certain flows in the graph.

Cited by

• Binomiality of colored Gaussian models

Related

• Digraph Branchings and Matrix Determinants
• Matrix tree theorem for the net Laplacian matrix of a signed graph
• enumeration of weighted paths on a digraph and block hook determinant
• An elementary proof of a matrix tree theorem for directed graphs
• Higher determinants and the matrix-tree theorem