Lo's conjecture on distinguishing connected graphs by subgraph sums
Statement
For a graph and a positive integer , let
Here is the set of sums over connected subgraphs of . Lo's conjecture. For any two non-isomorphic connected graphs and on vertices,
The conjecture asserts that the collection of subgraph-sum sets at total vertex weight distinguishes non-isomorphic connected graphs on the same number of vertices. It was proposed by Solomon Lo in connection with the study of tree spectra; no resolution is supplied here.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.