Butler et al.'s complement coalescing conjecture for distance matrices
Butler et al.'s complement coalescing conjecture for distance matrices
Let and be graphs with and . Coalescing conjecture. If coalescing the same connected rooted graph onto every vertex of and always produces cospectral pairs for the distance matrix, then coalescing the same connected rooted graph onto every vertex of and should also always produce cospectral pairs for the distance matrix. This conjecture concerns whether a universal coalescing construction for specified vertex sets is preserved when those sets are replaced by their complements; the paper states that it answers the conjecture negatively.
Sources & referencesView supporting material
Primary source
Sajid Bin Mahamud, Steve Butler, Hannah Graff, Nick Layman, Taylor Luck, Jiah Jin, Noah Owen and Angela Yuan, “Coalescing sets preserving cospectrality of graphs arising from block similarity matrices”, arXiv:2404.01561 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.