One significant area of research is the inverse eigenvalue problem of graphs, which investigates the conditions under which a given spectrum can be realized by a graph's adjacency matrix.

If you do not specify the COVSING= option, the nr smallest eigenvalues are set to zero, where nr is the number of rank deficiencies found in the first step. For optimization techniques that do not use ...