quality:correction, linguistic:paraphrasing, linguistic:translation, structural:expansion, information:extraction
Graphs determined by their spectrum

A graph G {\displaystyle G} is said to be determined by its spectrum if any other graph with the same spectrum as G {\displaystyle G} is isomorphic to G {\displaystyle G}.

Some first examples of families of graphs that are determined by their spectrum include: