\(LDL^ T\) factorizations of adjacency matrices where \(D\) is block diagonal (Q1183214): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q114215291 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4286076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Determinant of the Adjacency Matrix of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: $LU$ factorizations / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:42, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(LDL^ T\) factorizations of adjacency matrices where \(D\) is block diagonal |
scientific article |
Statements
\(LDL^ T\) factorizations of adjacency matrices where \(D\) is block diagonal (English)
0 references
28 June 1992
0 references
Authors's summary: For any symmetric matrix \(A\) over a field, it is shown that there exists a permutation matrix \(P\) such that \(PAP^ T=LDL^ T\) where \(L\) is a lower triangular matrix and \(D\) is block diagonal with \(1\times 1\) or \(2\times 2\) blocks. In particular, for the adjacency matrix of a bipartite graph \(G\), the vertices of \(G\) may be ordered so that the adjacency matrix of \(G\) is \(LDL^ T\) where all the diagonal blocks of \(D\) are \(2\times 2\). Furthermore, if \(G\) is a tree, this factorization may be done with integer matrices.
0 references
symmetric matrix
0 references
block diagonal
0 references
adjacency matrix
0 references
bipartite graph
0 references
tree
0 references
factorization
0 references
integer matrices
0 references