ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a graph be determined by its spectrum if every graph with the same adjacency-matrix spectrum is isomorphic to it.

Spectral determination conjecture. Almost every graph is determined by its spectrum.

This is a central question in spectral graph theory concerning how much information the adjacency spectrum encodes about graph structure. The statement is presented as a persisting problem; its resolution is not indicated in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.