Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
From MaRDI portal
(Redirected from Publication:1363700)
Recommendations
Cites work
- scientific article; zbMATH DE number 3906559 (Why is no real title available?)
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 3378927 (Why is no real title available?)
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A combinatorial approach to matrix algebra
- A combinatorial proof of the Cayley-Hamilton theorem
- Line-digraphs, arborescences and theorems of Tutte and Knuth
Cited in
(16)- Matrices with zero row sums, tree theorems and a Markov chain on trees
- Invertible matrices and semilinear spaces over commutative semirings
- 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
- On generalized fuzzy matrices with periods
- Dioïds and semirings: Links to fuzzy sets and other applications
- Bideterminant and generalized Kronecker-Capelli theorem for fuzzy relation equations
- On invertible matrices over antirings
- Some determinant expansions and the matrix-tree theorem
- scientific article; zbMATH DE number 825150 (Why is no real title available?)
- Around matrix-tree theorem
- On simultaneously nilpotent antiring matrices
- Determinant: Old algorithms, new insights
- On nilpotency of matrices over antirings
- On nilpotent matrices over antirings
- On nilpotency of generalized fuzzy matrices
This page was built for publication: Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363700)