A graph theoretic proof of the fundamental trace identity

DOI10.1016/0012-365X(88)90019-2zbMath0633.05042MaRDI QIDQ1095925

Hartmut Laue

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

circuit decompositiondirected multigraphfundamental trace identity

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Eulerian trace identities

Cites Work

• A formal inverse to the Cayley-Hamilton theorem
• The invariant theory of \(n\times n\) matrices
• The generalized Cayley-Hamilton theorem in n dimensions
• Graph-theoretic parameters concerning domination, independence, and irredundance