Butler et al.'s complement coalescing conjecture for distance matrices

Let G1G_1 and G2G_2 be graphs with B1V(G1)B_1\subseteq V(G_1) and B2V(G2)B_2\subseteq V(G_2). Coalescing conjecture. If coalescing the same connected rooted graph onto every vertex of B1B_1 and B2B_2 always produces cospectral pairs for the distance matrix, then coalescing the same connected rooted graph onto every vertex of V(G1)B1V(G_1)\setminus B_1 and V(G2)B2V(G_2)\setminus B_2 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.