1. Isospectral graphs and molecules
2. Almost every edge of a graph can be pseudosimilar. Theory and Applications of Graphs, Wiley (1981).
3. Removal-cospectral sets of vertices in a graph, Proceedings of the Tenth Southeast Conference on Combinatorics, Graph Theory, and Computing. Edited by Utilitas Mathematica, Winnipeg (1979) 849–860.