Unimodular congruence of the Laplacian matrix of a graph (Q1329994): Difference between revisions

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)].