References
- Bapat R, Kirkland SJ, Neumann M. On distance matrices and Laplacians. Linear Algebra Appl. 2005;401:193–209.
- West DB. Introduction to graph theory. Upper Saddle River (NJ): Prentice Hall; 1996.
- Bapat RB. Graphs and matrices. 2nd ed. London: Springer; New Delhi: Hindustan Book Agency; 2014.
- Smith HJS. On systems of linear indeterminate equations and congruences. Philos. Trans. R. Soc. London. 1861;151:293–326.
- Newman M. Integral matrices. New York (NY): Academic Press; 1972.
- Wallis WD, Wallis J. Equivalence of Hadamard matrices. Israel J. Math. 1969;7:122–128.
- Newman M. Invariant factors of combinatorial matrices. Israel J. Math. 1971;10:126–130.
- Grone R, Merris R, Watkins W. Laplacian unimodular equivalence of graphs. In: Brualdi R, Friedland S, Klee V, editors. Combinatorial and graph-theoretical problems in linear algebra. New York (NY): Springer-Verlag; 1993. p. 175–180.
- Merris R. Unimodular equivalence of graphs. Linear Algebra Appl. 1992;173:181–189.
- Williams G. Smith forms for adjacency matrices of circulant graphs. Linear Algebra Appl. 2014;443:21–33.
- Hou Y, Woo C. Distance unimodular equivalence of graphs. Linear Multilinear Algebra. 2008;56:611–626.
- Graham RL, Pollack HO. On the addressing problem for loop switching. Bell Syst. Tech. J. 1971;50:2495–2519.