A graph theoretic proof of the fundamental trace identity (Q1095925): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The generalized Cayley-Hamilton theorem in n dimensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The invariant theory of \(n\times n\) matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A formal inverse to the Cayley-Hamilton theorem / rank | |||
Normal rank | |||
Latest revision as of 12:43, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph theoretic proof of the fundamental trace identity |
scientific article |
Statements
A graph theoretic proof of the fundamental trace identity (English)
0 references
1988
0 references
To each circuit decomposition of a directed multigraph a permutation of the edge set is assigned, and a lemma on the signs of the resulting permutations is proved yielding the fundamental trace identity for matrices over a commutative unitary ring as a corollary.
0 references
circuit decomposition
0 references
directed multigraph
0 references
fundamental trace identity
0 references
