ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H1H_1 and H2H_2 be graphs, and let B1⊆V(H1)B_1\subseteq V(H_1) and B2⊆V(H2)B_2\subseteq V(H_2) be vertex sets. Let D\mathcal{D} denote the distance matrix, whose (u,v)(u,v)-entry records the distance between vertices uu and vv. Distance-matrix coalescing conjecture. If (H1,B1)(H_1,B_1) and (H2,B2)(H_2,B_2) are coalescing cospectral with respect to D\mathcal{D}, then (H1,V(H1)∖B1)(H_1,V(H_1)\setminus B_1) and (H2,V(H2)∖B2)(H_2,V(H_2)\setminus B_2) are also coalescing cospectral with respect to D\mathcal{D}. 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 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.