SpecDist

SpecDist is a collection of C++ programs for computing spectral distances between finite simple graphs. For two graphs of the same order, their spectral distance is defined as the sum of the absolute differences between corresponding eigenvalues arranged in non-increasing order. The eigenvalues may be those of the adjacency, Laplacian, or signless Laplacian matrices. The software also includes procedures for computing Laplacian and signless Laplacian energies. The programs were written by Irena Jovanović and Zoran Stanić.

Version 2.0 (2017), including all Windows executable files, sample input files, and the readme.pdf file with full instructions, is available here. The initial version, released in 2012, contained only SpecDist.exe.

Initial results obtained using SpecDist are reported in I. Jovanović and Z. Stanić, Spectral distances of graphs, Linear Algebra Appl., 436 (2012), 1425–1435; and I. Jovanović and Z. Stanić, Spectral distances of graphs based on their different matrix representations, Filomat, 28 (2014), 723–734.

If you use SpecDist in your research, please cite the first of the two papers above, which describes the software.