Two graphs are said to be cospectral if they have same eigenvalues wrt adjacency matrix, Normalised or Signless laplacian matrix. How many graphs has cospectral mates for a given number of nodes? We know answer to this question when number of nodes is less than $12$. I did not see any research paper till now where author has shown any algorithmic approach to compute those statistics. Either it is too simple to say or they do not wish to disclose it.


For a given number of nodes I like to compute number of graphs with at least one cospectral mate. Is there any algorithmic way to do so? If available please give me some references.


Thank you for your help. 



How many cospectral graphs available for a given number of nodes?
This appears an open problem according to a [paper](http://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1n20/pdf).



> 
> In connection with the graph isomorphism problem, it is of interest what fraction of all graphs is uniquely determined by its spectrum. Haemers onjectures that the fraction of
>  graphs on n vertices with a cospectral mate tends to zero as n tends to infinity.
>  Numerical data for n ≤ 9 was given in [2], and for n = 10, 11 in [3]. Here we do
>  n = 12, and also take the opportunity to correct a few earlier values.
> 
> 
> 




---


OEIS [A082104 Number of distinct characteristic polynomials among all simple undirected graphs on n nodes.](https://oeis.org/A082104) has some more references.


