Skip to main content
replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link

For your second question, if by probability you mean $$\lim_{n \to \infty} \frac{|S_n|}{|G_n|},$$ where $S_n$ is the set of all possible spectra of simple $n$-vertex graphs, and $G_n$ is the set of isomorphism classes of simple $n$-vertex graphs, then it is conjectured that the above probability is 1. That is, almost all graphs are determined by their spectrum.

See my answer to this questionquestion for more information and references.

For your second question, if by probability you mean $$\lim_{n \to \infty} \frac{|S_n|}{|G_n|},$$ where $S_n$ is the set of all possible spectra of simple $n$-vertex graphs, and $G_n$ is the set of isomorphism classes of simple $n$-vertex graphs, then it is conjectured that the above probability is 1. That is, almost all graphs are determined by their spectrum.

See my answer to this question for more information and references.

For your second question, if by probability you mean $$\lim_{n \to \infty} \frac{|S_n|}{|G_n|},$$ where $S_n$ is the set of all possible spectra of simple $n$-vertex graphs, and $G_n$ is the set of isomorphism classes of simple $n$-vertex graphs, then it is conjectured that the above probability is 1. That is, almost all graphs are determined by their spectrum.

See my answer to this question for more information and references.

Source Link
Tony Huynh
  • 32.1k
  • 11
  • 112
  • 187

For your second question, if by probability you mean $$\lim_{n \to \infty} \frac{|S_n|}{|G_n|},$$ where $S_n$ is the set of all possible spectra of simple $n$-vertex graphs, and $G_n$ is the set of isomorphism classes of simple $n$-vertex graphs, then it is conjectured that the above probability is 1. That is, almost all graphs are determined by their spectrum.

See my answer to this question for more information and references.