Generalized matrix tree theorem for mixed graphs

Linear and Multilinear Algebra

Volumn 46, Issue 4, 1999, Pages 299-312

  Bapat, Ravindra B ^a   Grossman, Jerrold W ^b   Kulkarni, Devadatta M ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b OAKLAND UNIVERSITY   (United States)

Author keywords

Generalized matching; k reduced spanning substructure; Laplacian; Matrix Tree Theorem; Mixed graph; Non singular substructure; Quasi bipartite graph

Indexed keywords

EID: 0141636394     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: 10.1080/03081089908818623     Document Type: Article

References (8)

1. Bapat, R. B., Grossman, J. W. and Kulkarni, D. M., Edge version of the Matrix Tree Theorem for trees, preprint.
2. Bondy, J. A. and Murty, U. S. R. (1976). Graph Theory with Applications, American Elsevier Publishing Co., New York, MR 54#117.
3. Chaiken, S. (1982). A combinatorial proof of the all minors Matrix Tree Theorem, SIAM Journal Algebraic Discrete Methods, 3, 319-329, MR 83h:05062.
4. Constantine, G. M. (1987). Combinatorial Theory and Statistical Design, Wiley, New York, MR 88k:05001.
5. Grossman, J. W., Kulkarni, D. M. and Schochetman, I. E. (1994). Algebraic graph theory without orientation, Linear Algebra and its Applications, Proceedings of the 3rd ILAS Conference (Pensacola, FL, 1993), 212/213, 289-308, MR 96b:05111.
6. Grossman, J. W., Kulkarni, D. M. and Schochetman, I. E. (1995). On the minors of an incidence matrix and its Smith normal form, Linear Algebra and its Applications, 218, 213-224, MR 95m:15020.
7. Marcus, M. and Minc, H. (1964). A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston, MR 29#112.
8. Merris, R. (1993). Laplacian matrices of graphs: a survey, Second Conference of the International Linear Algebra Society (ILAS) (Lisbon, 1992), Linear Algebra and its Applications, 197/198, 143-176, MR 95e:05084.