{"id":"hexagon/2611.00564","pdf":"https://hexagonmath.org/pdf/2611.00564v1","url":"https://hexagonmath.org/abs/2611.00564v1","tags":["math.SP","msc:05C50","msc:05C12","msc:05C35","msc:05E30","Graffiti conjecture","Moore graph","counterexample","distance spectrum","dual degree"],"score":0,"title":"Counterexamples, Spectral Obstructions, and Deletion Stability for WOW-284","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Samuil Petkov"],"reviews":0,"subject":"math.CO","summary":"WOW-284 is a Graffiti conjecture asserting that every connected graph of order at least three and girth at least five has minimum dual degree at most $-\\lambda_{\\min}(D)$, where $D$ is the distance matrix and the dual degree of a vertex is the average degree of its neighbors. We refute it with exact counterexamples on $38$, $39$, $40$, $42$ and $50$ vertices and study the structure of regular counterexamples. For a connected $k$-regular graph $G$ of girth at least five and diameter three, we prove that $\\delta^*(G)+\\lambda_{\\min}(D)=2k-2-\\max_\\theta(\\theta+1)^2$, the maximum being over the…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","Codex"],"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}