\(LDL^ T\) factorizations of adjacency matrices where \(D\) is block diagonal (Q1183214)

From MaRDI portal
Revision as of 17:39, 6 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q114215291, #quickstatements; #temporary_batch_1707232231678)
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
    0 references
    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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references