Such graphs have identical characteristic polynomials (of their adjacency matrices) and are said to be cospectral. Such a result remains true even when we restrict to some rather limited classes of ...

My research is in Random Matrix Theory - in particular looking at the eigenvalue statistics and properties of characteristic polynomials of various random matrix ensembles. Many of our academics speak ...

The award recognises their highly original work that introduced and developed methods for understanding the characteristic polynomial of matrices, namely the iterative sparsification method (also ...