Distance-matrix complement conjecture for coalescing cospectral sets
Statement
Let and be graphs, and let and be vertex sets. Let denote the distance matrix, whose -entry records the distance between vertices and . Distance-matrix coalescing conjecture. If and are coalescing cospectral with respect to , then and are also coalescing cospectral with respect to . This conjecture is motivated by computational experimentation on small graphs and would extend the complement result proved in the paper to the distance matrix. An obstacle to proving it is that the authors' techniques rely on cycle decompositions to express characteristic polynomials of coalesced graphs in simple terms.
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.