Matrices, digraphs and determinants
dc.contributor.author | Maybee, John S. | |
dc.contributor.author | Olesky, D.D. | |
dc.contributor.author | van den Driessche, P. | |
dc.contributor.author | Wiener, G. | |
dc.date.accessioned | 2009-08-14T21:33:55Z | |
dc.date.available | 2009-08-14T21:33:55Z | |
dc.date.copyright | 1987 | en |
dc.date.issued | 2009-08-14T21:33:55Z | |
dc.description.abstract | We present a detailed account of various determinantal formulas in a graph-theoretic form involving paths and cycles in the digraph of the matrix. For cases in which the digraph has special local properties, for example a cutpoint or a bridge, we give particular formulas which are more efficient for computing the determinant than simply using the matrix representation. Applications are also given to characteristic determinants, general minors and cofactors. | en |
dc.description.sponsorship | NSERC Grant A8214, NSERC Grant A8965 and the University of Victoria Committee on Faculty Research and Travel | en |
dc.identifier.uri | http://hdl.handle.net/1828/1509 | |
dc.language.iso | en | en |
dc.relation.ispartofseries | DM-445-IR | en |
dc.subject | digraph | en |
dc.subject | cycle | en |
dc.subject | determinant | en |
dc.subject | minor | en |
dc.subject | cofactor | en |
dc.title | Matrices, digraphs and determinants | en |
dc.type | Technical Report | en |