Unimodular congruence of the Laplacian matrix of a graph (Q1329994)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Unimodular congruence of the Laplacian matrix of a graph
scientific article

    Statements

    Unimodular congruence of the Laplacian matrix of a graph (English)
    0 references
    0 references
    15 August 1994
    0 references
    Let \(Q= Q(G)\) be an oriented vertex-edge incidence matrix of the graph \(G\). Then \(L(G)= QQ^ t\) is the Laplacian matrix of \(G\) and \(K(G)= Q^ t Q\) is an edge version of the Laplacian. In this note it is shown that Laplacian matrices \(L(G)\) and \(L(H)\) of graphs \(G\) and \(H\), respectively, are unimodularly congruent if and only if \(G\) and \(H\) are cycle isomorphic. The related problem of unimodular congruence of Laplacian matrices has been recently solved by \textit{R. Merris} [A note on unimodular congruence of graphs, Linear Algebra Appl. 201, 57-60 (1994; preceding review)].
    0 references
    0 references
    Laplacian matrix
    0 references
    unimodular congruence
    0 references
    0 references
    0 references