Application of Tree-like Structure of Graph to Matrix Analysis

Simple item page
dc.creatorBuslov, V. A.
dc.date2000-01-28
dc.date.accessioned2026-07-07T04:33:28Z
dc.date.available2026-07-07T04:33:28Z
dc.descriptionFormulas for matrix determinants, algebraic adjunctions, characteristic polynomial coefficients, components of eigenvectors are obtained in the form of signless sums of matrix elements products taking by special graphs. Signless formulas are very important for singular and stochastic problems. They are also useful for spectral analysis of large very sparse matrices.
dc.descriptionLaTeX, 11 pages
dc.identifierhttps://arxiv.org/abs/math/0001163
dc.identifierhttp://arxiv.org/abs/math/0001163
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/58585
dc.subjectCombinatorics
dc.titleApplication of Tree-like Structure of Graph to Matrix Analysis
dc.typetext

Files

Collections

arXiv