Bideterminants, arborescences and extension of the Matrix-Tree Theorem to semirings

Discrete Mathematics

Volumn 171, Issue 1-3, 1997, Pages 191-200

  Minoux, M ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Arborescences in graphs; Bideterminants; Linear algebra in semirings; Path algebras; Rooted directed trees

Indexed keywords

EID: 0040560511     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00015-5     Document Type: Article

References (11)

1. C.W. Borchardt, Über eine der Interpolation entsprechende Darstellung der Eliminations-Résultante, J. Reine Angew. Math. 57 (1860) 111-121.
2. S. Chaiken, A combinatorial proof of the All Minors Matrix-Tree Theorem, SIAM J. Algebraic Discrete Methods 3 (1982) 319-329.
3. M. Gondran and M. Minoux, Valeurs propres et vecteurs propres dans les dioïdes, et leurs interprétations en théorie des graphes, Bull. Direction Etudes Recherches EDF, Sér. C(2) (1977) 25-41.
4. M. Gondran and M. Minoux, L'indépendance linéaire dans les dioïdes, Bull. Direction Etudes Recherches EDF Sér. C(1) (1978) 67-90.
5. M. Gondran and M. Minoux, Linear algebra in dioïds. A survey of recent results, Ann. Discrete Math. 9 (1984) 147-164.
6. M. Gondran and M. Minoux, Graphes et Algorithmes (Eyrolles, Paris, 3rd ed., 1995).
7. P. Kuntzmann, Théorie des Réseaux (Dunod, Paris, 1972).
8. J.B. Orlin, Line-digraphs, arborescences and theorems of Tutte and Knuth, J. Combin. Theory Ser. B 25 (1978) 187-198.
9. M. Straubing, A combinatorial proof of the Cayley-Hamilton theorem, Discrete Math. 43 (1983) 273-279.
10. W.T. Tutte, The dissection of equilateral triangles into equilateral triangles, Proc. Cambridge Philos. Soc. 44 (1948) 463-482.
11. D. Zeilberger, A combinatorial approach to matrix algebra, Discrete Math. 56 (1985) 61-72.