Bideterminants, arborescences and extension of the matrix-tree theorem to semirings

DOI10.1016/S0012-365X(96)00015-5zbMath0880.05065MaRDI QIDQ1363700

Michel Minoux

Publication date: 19 January 1998

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

zbMATH Keywords

matrix-tree theoremrooted directed trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Semirings (16Y60)

Related Items

Dioïds and semirings: Links to fuzzy sets and other applications ⋮ Determinant: Old algorithms, new insights ⋮ On simultaneously nilpotent antiring matrices ⋮ On invertible matrices over antirings ⋮ Invertible matrices and semilinear spaces over commutative semirings ⋮ On nilpotent matrices over antirings ⋮ Bideterminant and Generalized Kronecker-Capelli Theorem for Fuzzy Relation Equations ⋮ On generalized fuzzy matrices with periods ⋮ On nilpotency of matrices over antirings ⋮ On nilpotency of generalized fuzzy matrices ⋮ Extension of MacMahon's master theorem to pre-semi-rings ⋮ The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields

Cites Work

• A combinatorial proof of the Cayley-Hamilton theorem
• A combinatorial approach to matrix algebra
• Line-digraphs, arborescences and theorems of Tutte and Knuth
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item