Auchiche–Hansen's proximity and distance eigenvalue conjecture
Auchiche–Hansen's proximity and distance eigenvalue conjecture
Let be a connected graph on vertices with diameter , proximity and distance spectrum . Auchiche–Hansen's conjecture.
This conjecture would strengthen a result of Merris on proximity and distance eigenvalues. It is refuted by a connected graph obtained from a path on 13 vertices by attaching sufficiently many pendant vertices; specifically, the construction gives a counterexample for all pendant vertices.
Sources & referencesView supporting material
Primary source
Adam Zsolt Wagner, “Constructions in combinatorics via neural networks”, arXiv:2104.14516 (2021).
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.